A Logic-Based Framework for Reactive Systems

  • Robert Kowalski
  • Fariba Sadri
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7438)


We sketch a logic-based framework in which computation consists of performing actions to generate a sequence of states, with the purpose of making a set of reactive rules in the logical form antecedents ( consequents all true. The antecedents of the rules are conjunctions of past or present conditions and events, and the consequents of the rules are disjunctions of conjunctions of future conditions and actions. The antecedents can be viewed as complex/composite events, and the consequents as complex/composite/macro actions or processes.

States are represented by sets of atomic sentences, and can be viewed as global variables, relational databases, Herbrand models, or mental representations of the real world. Events, including actions, transform one state into another. The operational semantics maintains only a single, destructively updated current state, whereas the model-theoretic semantics treats the entire sequence of states, events and actions as a single model. The model-theoretic semantics can be viewed as the problem of generating a model that makes all the reactive rules true.


reactive systems model generation LPS KELPS complex events complex actions 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bonner, Kifer, M.: Transaction logic programming. In: Warren, D.S. (ed.) Proc. of the 10th International Conf. on Logic Programming, pp. 257–279 (1993)Google Scholar
  2. 2.
    Carriero, N., Gelernter, D.: Linda in Context. Communications of the ACM 32(4) (1989)Google Scholar
  3. 3.
    van Emden, M., Kowalski, R.: The Semantics of Predicate Logic as a Programming Language. JACM 23(4), 733–742 (1976)zbMATHCrossRefGoogle Scholar
  4. 4.
    Fisher, M.: A Survey of Concurrent METATEM - The Language and its Applications. In: Gabbay, D.M., Ohlbach, H.J. (eds.) ICTL 1994. LNCS, vol. 827, pp. 480–505. Springer, Heidelberg (1994)CrossRefGoogle Scholar
  5. 5.
    Forgy, C.L.: Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence 19(1), 17–37 (1982)CrossRefGoogle Scholar
  6. 6.
    Fung, T.H., Kowalski, R.: The IFF Proof Procedure for Abductive Logic Programming. J. of Logic Programming (1997)Google Scholar
  7. 7.
    Harel, D.: Statecharts: A Visual Formalism for Complex Systems. Sci. Comput. Programming 8, 231–274 (1987)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Harel, D.: Statecharts in the Making: A Personal Account. In: Proc. 3rd ACM SIGPLAN History of Programming Languages Conference, HOPL III (2007)Google Scholar
  9. 9.
    Hausmann, S., Scherr, M., Bry, F.: Complex Actions for Event Processing, Research Report, Institute for Informatics, University of Munich (2012)Google Scholar
  10. 10.
    Hayes-Roth, B.: A Blackboard Architecture for Control. Artificial Intelligence 26(3), 251–321 (1985)CrossRefGoogle Scholar
  11. 11.
    Kakas, T., Kowalski, R., Toni, F.: The Role of Logic Programming in Abduction. In: Handbook of Logic in Artificial Intelligence and Programming, vol. 5, pp. 235–324. Oxford University Press (1998)Google Scholar
  12. 12.
    Knuth, D.E.: The Art of Computer Programming, vol. 1: Fundamental Algorithms. Addison-Wesley (1973)Google Scholar
  13. 13.
    Kowalski, R.: Computational Logic and Human Thinking: How to be Artificially Intelligent. Cambridge University Press (2011)Google Scholar
  14. 14.
    Kowalski, R., Sadri, F.: From Logic Programming Towards Multi-agent Systems. Annals of Mathematics and Artificial Intelligence 25, 391–419 (1999)MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Kowalski, R., Sadri, F.: Integrating Logic Programming and Production Systems in Abductive Logic Programming Agents. In: Polleres, A., Swift, T. (eds.) RR 2009. LNCS, vol. 5837, pp. 1–23. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  16. 16.
    Kowalski, R., Sadri, F.: An Agent Language with Destructive Assignment and Model-Theoretic Semantics. In: Dix, J., Leite, J., Governatori, G., Jamroga, W. (eds.) CLIMA XI. LNCS, vol. 6245, pp. 200–218. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  17. 17.
    Kowalski, R., Sadri, F.: Abductive Logic Programming Agents with Destructive Databases. Annals of Mathematics and Artificial Intelligence 62(1), 129–158 (2011)MathSciNetzbMATHCrossRefGoogle Scholar
  18. 18.
    Kowalski, R., Sadri, F.: Programming With Logic Without logic Programming. Department of Computing, Imperial College London Report (2012)Google Scholar
  19. 19.
    Kowalski, R., Sergot, M.: A Logic-based Calculus of Events. New Generation Computing 4(1), 67–95 (1986)CrossRefGoogle Scholar
  20. 20.
    McCarthy, J., Hayes, P.: Some Philosophical Problems from the Standpoint of Artificial Intelligence. In: Machine Intelligence, vol. 4, pp. 463–502 (1969)Google Scholar
  21. 21.
    Przymusinski, T.: On the Declarative Semantics of Stratified Deductive Databases and Logic Programs. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 193–216. Morgan Kaufmann (1987)Google Scholar
  22. 22.
    Reisig, W.: The Expressive Power of Abstract-State Machines. Computing and Informatics 22, 209–219 (2003)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Robert Kowalski
    • 1
  • Fariba Sadri
    • 1
  1. 1.Department of ComputingImperial College LondonUK

Personalised recommendations