Roger L. Wainwright, Hisham M. Haddad, Ronaldo Menezes, Mirko Viroli (eds.)
23rd ACM Symposium on Applied Computing (SAC 2008), pages 191–197
ACM, Fortaleza, Ceará, Brazil
March 2008
The implementation of Prolog systems has a long history, from the first interpreter written in 1972 to de facto standard model of the Warren Abstract Machine. Although many architectural variations have been proposed, object-oriented design was left mostly unexplored, favoring other factors such as execution time and memory storage optimizations. However, today complex software systems are typically built as aggregates of heterogeneous components, where logic programming may effectively help facing key issues such as intelligence of components and management of interaction. In this scenario, implementation of logic languages could just aim at reasonable – rather than maximum – efficiency, requiring instead configurable and flexible architectures to allow for extensions and tailoring for different application domains. tuProlog is an object-oriented Prolog engine which has been designed to feature a malleable architecture at its core, and to exhibit the typical properties of basic components for complex dynamic systems and intelligent infrastructures—such as easy deployability, lightness, and configurability. In this paper, we first describe tuProlog's malleable architecture, composed by a set of managers controlling sensible parts of the system, and operating around a minimal interpreter shaped as a Finite State Machine. Then, we support the malleability claim by discussing two possible architectural extension of the engine.
keywords
Prolog, Finite State Machine, object-oriented design
reference talk
works as
reference publication for talk