Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computational Logic

CL 2000: Computational Logic — CL 2000 pp 777–791Cite as

A Meta-logical Semantics for Features and Fluents Based on Compositional Operators over Normal Logic Programs

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1861))

Abstract

Features & Fluents is a logical framework proposed by Erik Sandewall for reasoning about action and change by means of a logical language called discrete fluent logic (DFL). In this paper we extend the Sandewall’s framework for dealing with continuous time and we introduce a knowledge representation language based on a Horn-like fragment of DFL which we called fluent logic programming. A meta-logical semantics is described as the proof-theoretical counterpart of FLP in alternative to the Sandewall original encapsulated semantics. This semantics makes use of composition operators over general logic programs and can be also considered as an attempt of providing a basis for an effective implementation of a proof-system for a meaningful fragment of the Features & Fluents temporal logic.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Krzysztof R. Apt. Logic Programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B. Elsevier, 1990.

    Google Scholar 

  2. Krzysztof R. Apt and Roland N. Bol. Logic programming and negation: A survey. The Journal of Logic Programming, 19 & 20:9–72, May 1994.

    Google Scholar 

  3. A. Ballim and Y. Wilks. Artificial Believers. Lawrence Erlbaum Associates, Hillsdale, New Jersey, 1991.

    Google Scholar 

  4. Alexandra Baltag. A logic of epistemic actions. In W. Van der Hoek, J.J. Meyer, and C. Witteveen, editors, Workshop on Foundations and applications of collective agent based systems (CABS), Utrecht, August 1999. ESSLLI99.

    Google Scholar 

  5. J.J. Blanc, Rachid Echahed, and Wendelin Serwe. Towards reactive functional logic programming languages. In Herbert Kuchen, editor, Proc. of 8th Workshop on Functional and Logic Programming, 1998.

    Google Scholar 

  6. Sergio Brandano. A logic-based calculus of fluents. Technical Report TR-98-01, Dipartimento di Informatica, January 12 1998. Sun, 25 Jan 1998 18:08:16 GMT.

    Google Scholar 

  7. A. Brogi, S. Contiero, and F. Turini. Programming by Combining General Logic Programs. Technical Report 97-02, Department of Computer Science, University of Pisa, 1997.

    Google Scholar 

  8. K. L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293–322. Plenum Press, New York, 1978.

    Google Scholar 

  9. M. Denecker, L. Missiaen, and M. Bruynooghe. Temporal reasoning with abductive event calculus. In Bernd Neumann, editor, Proceedings of the 10th European Conference on Artificial Intelligence, pages 384–388, Vienna, Austria, August 1992. John Wiley & Sons, Ltd.

    Google Scholar 

  10. K.J. Dryllerakis. Residual SLDNF in CLP languages. Technical report, Logic Programming Group Imperial College, 1995.

    Google Scholar 

  11. K. Eshghi and R. Kowalski. Abduction compared with negation by failure. In G. Levi and M. Martelli, editors, Proceedings of the 6th International Conference and 5th Symposium on Logic Programming, pages 234–254. MIT Press, 1989.

    Google Scholar 

  12. Nastaran Fatemi and Philippe Mulhem. A conceptual graph approach for video data representation and retrieval. In M. Berthold, editor, Proceedings of third symposium on Intelligent Data Analysis IDA’99. Lecture Notes in Computer Science, 1999.

    Google Scholar 

  13. Melvin C. Fitting. A Kripke-Kleene semantics for logic programming. Journal of Logic Programming, 4:295–312, 1985.

    Article  MathSciNet  Google Scholar 

  14. P. M. Hill and J. Gallagher. Meta-programming in logic progamming. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 5, pages 421–498. Oxford University Press, 1998.

    Google Scholar 

  15. A. Kakas and R. Miller. A simple declarative language for describing narratives with actions. The Journal of Logic Programming, 1997.

    Google Scholar 

  16. A. Kakas and C. Mourlas. Aclp: Flexible solutions to complex problems. In Proceedings of Logic Programming and Non-monotonic Reasoning conference LPNMR97, 1997.

    Google Scholar 

  17. R. Kowalski and M. Sergot. A logic based calculus of events. New Generation Computing, 4:67–95, 1986.

    Article  Google Scholar 

  18. Vincenzo Pallotta. Integrazione della programmazione logica e della logica dei fluenti. Master’s thesis, Universitá di Pisa, december 1997. http://lithwww.epf1.ch/~pallotta/tesi.ps.gz.

  19. Vincenzo Pallotta. An abductive semantics for fluent logic programming. http://Iithwww.epf1.ch/~pallotta/abductive_flp.ps.gz, September 1999.

  20. Vincenzo Pallotta. Reasoning about fluents in logic programming. In Rachid Echahed, editor, Proocedings of 8th International Workshop on Functional and Logic Programming, volume RR 1021-I-of Raport de Recherche, pages 75–91, Grenoble, June 1999. CNRS-INPG, Laboratoire LEIBNIZ-Institute IMAG.

    Google Scholar 

  21. Vincenzo Pallotta and Franco Turini. Towards a fluent logic programming. Technical Report TR-98-03, Dipartimento di Informatica, March 9 1998. Wed, 11 Mar 1998 09:26:54 GMT.

    Google Scholar 

  22. Fariba Sadri and Robert A. Kowalski. Variants of the event calculus. In Leon Sterling, editor, Proceedings of the 12th International Conference on Logic Programming, pages 67–82, Cambridge, June 13–18 1995. MIT Press.

    Google Scholar 

  23. E. Sandewall. Features and Fluents. Oxford Press, 1994.

    Google Scholar 

  24. M. Shanahan. Representing continuous change in the Event Calculus. In Proceedings of the 9th European Conference on Artificial Intelligence, page 598, 1990.

    Google Scholar 

  25. M.P. Shanahan. Solving the Frame Problem. MIT Press, 1997.

    Google Scholar 

  26. Murray Shanahan. Prediction is deduction but explanation is abduction. In N. S. Sridharan, editor, Proceedings of the 11th International Joint Conference on Artificial Intelligence, pages 1055–1060, Detroit, MI, USA, August 1989. Morgan Kaufmann.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Theoretical Computer Science Laboratory (LITH), Swiss Federal Institute of Technology - Lausanne, IN-F Ecublens, 1015, Lausanne

    Vincenzo Pallotta

Authors
  1. Vincenzo Pallotta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The Australian National University, Australia

    John Lloyd

  2. Simon Fraser University, Canada

    Veronica Dahl

  3. Universität Koblenz, Germany

    Ulrich Furbach

  4. The University of Birmingham, UK

    Manfred Kerber

  5. University of Manchester, UK

    Kung-Kiu Lau

  6. The Pennsylvania State University, USA

    Catuscia Palamidessi

  7. Universidade Nova de Lisboa, Portugal

    Luís Moniz Pereira

  8. The Hebrew University of Jerusalem, Israel

    Yehoshua Sagiv

  9. The University of Melbourne, Australia

    Peter J. Stuckey

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pallotta, V. (2000). A Meta-logical Semantics for Features and Fluents Based on Compositional Operators over Normal Logic Programs. In: Lloyd, J., et al. Computational Logic — CL 2000. CL 2000. Lecture Notes in Computer Science(), vol 1861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44957-4_52

Download citation

  • DOI: https://doi.org/10.1007/3-540-44957-4_52

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67797-0

  • Online ISBN: 978-3-540-44957-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation