# LPS

LPS is an acronym for Logic-based Production System-like language^{[1]}^{[2]}^{[3]}^{[4]}^{[5]}^{[6]}^{[7]}^{[8]}. LPS combines reactive Rules with Logic programs. The purpose of this page is to keep trace of the developments of this language and to provide relationship with RuleML family of languages.

An LPS framework is a state transition system, specified by a tuple <R, L, D> consisting of:

- a set R of reactive rules in the form ∀X [antecedent(X) → ∃ Y consequent(X, Y)] designed based on principle
*past and present formula*implies*present or future formula*^{[9]}. - a logic program L representing an agent's view of states and events. It includes definitions of intensional predicates, composite events, and auxiliary predicates, which do not change over time.
- a domain theory D, which specifies the preconditions and postconditions of state transitions. States
*S_i*are represented by sets of atomic sentences, called*facts*or*fluents*. States are like relational databases. State transitions take place as the result of event occurrences. State updates are destructive.

The LPS kernel called KELPS(**Ke**rnel of **LPS**) is the core language keeping the reactive rules and the domain theory but reducing the logic program to a set of atoms. These atoms refers to auxiliary predicates particularly to temporal constraint predicates such as i < j or i *≤ j* between time points as well as time independent atoms such as the *isa* relation.

## 1 Related News

- The Sad State Concerning the Relationships between Logic, Rules and Logic Programming by Robert Kowalski, January 13, 2015 on the RuleML blog http://blog.ruleml.org/post/32629706-the-sad-state-concerning-the-relationships-between-logic-rules-and-logic-programming/

## 2 References

- ↑ R. Kowalski, F. Sadri,Integrating Logic Programming and Production Systems in Abductive Logic Programming Agents, In Web Reasoning and Rule Systems (eds. A. Polleres and T. Swift) Springer, LNCS 5837. 2009.
- ↑ R. Kowalski, F. Sadri An Agent Language with Destructive Assignment and Model-theoretic Semantics, In CLIMA XI - Computational Logic in Multi- Agent Systems (eds. J. Dix, G. Governatori, W. Jamroga and J. Leite) Springer, 2010.
- ↑ R. Kowalski, F. Sadri Abductive Logic Programming Agents with Destructive Databases, In Annals of Mathematics and Artificial Intelligence, 2011.
- ↑ R. Kowalski and F. Sadri, Teleo-Reactive Abductive Logic Programs, In Festschrift for Marek Sergot.(eds: Alexander Artikis, Robert Craven, Nihan Kesim, Babak Sadighi, and Kostas Stathis), Springer, 2012.
- ↑ R. Kowalski and F. Sadri, A Logic-Based Framework for Reactive Systems,RuleML 2012, A Bikakis and A Giurca(Eds.): RuleML 2012, LNCS 7438, pp. 1-15, Springer verlag Berlin Heidelberg, 2012.
- ↑ R. Kowalski and F. Sadri, A Logical Characterization of a Reactive System Language, RuleML 2014, A. Bikakis et al. (Eds.): RuleML 2014, LNCS 8620, pp. 22-36, Springer International Publishing Switzerland , 2014.
- ↑ R. Kowalski and F. Sadri, Reactive Computing as Model Generation, to appear in New Generation Computing, Vol. 33-1, January 2015.
- ↑ F. Sadri and R. Kowalski, LPS and its Kernel KELPS: Logic-Based State Transition Frameworks, RuleML Webinar, January 22, 2015 (slides)
- ↑ Fisher, M.: A Survey of Concurrent METATEM - The Language and its Applications. Lecture notes in computer science, 827, Springer Verlag 480-505 (1994)