Skip to main content
SpringerLink
Log in

A Logical Characterization of a Reactive System Language

  • Conference paper
Book cover Rules on the Web. From Theory to Applications (RuleML 2014)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 8620))

Abstract

Typical reactive system languages are programmed by means of rules of the form if antecedent then consequent. However, despite their seemingly logical character, hardly any reactive system languages give such rules a logical interpretation. In this paper, we investigate a simplified reactive system language KELPS, in which rules are universally quantified material implications, and computation attempts to generate a model that makes the rules true.

The operational semantics of KELPS is similar to that of other reactive system languages, and is similarly incomplete. It cannot make a rule true by making its antecedent false, or by making its consequent true whether or not its antecedent becomes true. In this paper, we characterize the reactive models computed by the operational semantics. Informally speaking, a model is reactive if every action in the model is an instance of an action in the consequent of a rule whose earlier conditions are true.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barringer, H., Fisher, M., Gabbay, D., Owens, R., Reynolds, M.: The imperative future: Principles of executable temporal logic. John Wiley & Sons, Inc. (1996)

    Google Scholar 

  2. Bonner, A., Kifer, M.: Transaction logic programming. In: Warren, D.S. (ed.) Logic Programming: Proc. of the 10th International Conf., pp. 257–279 (1993)

    Google Scholar 

  3. Eshghi, K.: Abductive Planning with Event Calculus. In: ICLP/SLP, pp. 562–579 (1988)

    Google Scholar 

  4. Gurevich, Y.: Evolving algebras 1993: Lipari guide. In: Specification and validation Methods, pp. 9–36 (1995)

    Google Scholar 

  5. Harel, D.: Statecharts: A Visual Formalism for Complex Systems. Sci. Comput. Programming 8, 231–274 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  6. Jaffar, J., Lassez, J.L.: Constraint logic programming. In: Proceedings of the 14th ACM SIGACT-SIGPLAN Symposium on Principles of programming languages, pp. 111–119. ACM (1987)

    Google Scholar 

  7. Kakas, A.C., 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 Univerpsity Press (1998)

    Google Scholar 

  8. Kakas, A.C., Mancarella, P., Sadri, F., Stathis, K., Toni, F.: The KGP model of agency. In: Proc. ECAI 2004 (2004)

    Google Scholar 

  9. Kowalski, R., Sadri, F.: From Logic Programming Towards Multi-agent Systems. Annals of Mathematics and Artificial Intelligence 25, 391–419 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  10. 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)

    Chapter  Google Scholar 

  11. 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 (LNAI), vol. 6245, pp. 200–218. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  12. Kowalski, R., Sadri, F.: Abductive Logic Programming Agents with Destructive Databases. Annals of Mathematics and Artificial Intelligence 62(1), 129–158 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  13. Kowalski, R., Sadri, F.: A Logic-Based Framework for Reactive Systems. In: Bikakis, A., Giurca, A. (eds.) RuleML 2012. LNCS, vol. 7438, pp. 1–15. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  14. Kowalski, R., Sadri, F.: Model-theoretic and operational semantics for Reactive Computing. To Appear in New Generation Computing (2014)

    Google Scholar 

  15. Kowalski, R., Sergot, M.: A Logic-based Calculus of Events. New Generation Computing 4(1), 67–95 (1986)

    Article  Google Scholar 

  16. Paschke, A., Boley, H., Zhao, Z., Teymourian, K., Athan, T.: Reaction RuleML 1.0: standardized semantic reaction rules. In: Bikakis, A., Giurca, A. (eds.) RuleML 2012. LNCS, vol. 7438, pp. 100–119. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  17. Shanahan, M.: Solving the frame problem: A mathematical investigation of the common sense law of inertia. MIT press (1997)

    Google Scholar 

  18. Shanahan, M.: An abductive event calculus planner. The Journal of Logic Programming 44(1), 207–240 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  19. Fikes, R.E., Nilsson, N.J.: STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 2(3), 189–208 (1972)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing, Imperial College, London, UK

    Robert Kowalski & Fariba Sadri

Authors
  1. Robert Kowalski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fariba Sadri
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Information Studies, University College London, Gower Street, WC1E 6BT, London, UK

    Antonis Bikakis

  2. Department of Computer Science, Stony Brook University, 11794, Stony Brook, NY, USA

    Paul Fodor

  3. SINTEF, University of Oslo, Forskningsveien 1, 0314, Oslo, Norway

    Dumitru Roman

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Kowalski, R., Sadri, F. (2014). A Logical Characterization of a Reactive System Language. In: Bikakis, A., Fodor, P., Roman, D. (eds) Rules on the Web. From Theory to Applications. RuleML 2014. Lecture Notes in Computer Science, vol 8620. Springer, Cham. https://doi.org/10.1007/978-3-319-09870-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09870-8_2

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09869-2

  • Online ISBN: 978-3-319-09870-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation