Skip to main content
SpringerLink
Log in

Signed formula logic programming: Operational semantics and applications (extended abstract)

  • Communications Session 2B Logic for AI
  • Conference paper
  • First Online:
Foundations of Intelligent Systems (ISMIS 1996)

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

Included in the following conference series:

Abstract

Signed formula can be used to reason about a wide variety of multiple-valued logics. The formal theoretical foundation of logic programming based on signed formulas is developed in [14]. In this paper, the operational semantics of signed formula logic programming is investigated through constraint logic programming. Applications to bilattice logic programming and truth-maintenance are considered.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Baaz and C. G. Fermüller. Resolution for many-valued logics. In A. Voronkov, editor, Proceedings of Conference Logic Programming and Automated Reasoning, pages 107–118. Springer-Verlag, 1992.

    Google Scholar 

  2. D. Debertin. Parallel inference algorithms for distributed knowledge bases (in German). Master's thesis, Institute for Algorithms and Cognitve Systems, University of Karlsruhe, 1994.

    Google Scholar 

  3. J. DeKleer. An assumption-based TMS. Artificial Intelligence, 28:127–162, 1986.

    Google Scholar 

  4. D. Fehrer. A Unifying Framework for Reason Maintenance. In Michael Clarke, Rudolf Kruse, and Serafín Moral, editors, Symbolic and Quantitative Approaches to Reasoning and Uncertaint y, Proceedings of ECSQARU '93, Granada, Spain, Nov. 1993, volume 747 of Lecture Notes in Computer Science, pages 113–120, Berlin, Heidelberg, 1993. Springer.

    Google Scholar 

  5. M. Fitting. Bilattices and the semantics of logic programming. Journal of Logic Programming, 11:91–116, 1991.

    Google Scholar 

  6. T. Frühwirth. Annotated constraint logic programming applied to temporal reasoning. In Proceedings of the Symposium on Programming Language Implementation and Logic Programming, pages 230–243. Springer-Verlag, 1994.

    Google Scholar 

  7. Dov M. Gabbay. LDS-labelled deductive systems. Preprint, Dept. of Computing, Imperial College, London, September 1989.

    Google Scholar 

  8. M.L. Ginsberg. Multivalued logics: A uniform approach to inference in artificial intelligence. Computational Intelligence, 4(3):265–316, 1988.

    Google Scholar 

  9. R. Hähnle. Uniform notation of tableau rules for multiple-valued logics. In Proceedings of the International Symposium on Multiple-Valued Logic, pages 26–29. Computer Society Press, 1991.

    Google Scholar 

  10. R. Hähnle. Short normal forms for arbitrary finitely-valued logics. In Proceedings of International Symposium on Methodologies for Intelligent Systems, pages 49–58. Springer-Verlag, 1993.

    Google Scholar 

  11. J. Jaffar and J-L. Lassez. Constraint logic programming. In Proceedings of the 14th ACM Symposium on Principles of Programming Languages, pages 111–119. ACM Press, 1987.

    Google Scholar 

  12. M. Kifer and V.S. Subrahmanian. Theory of generalized annotated logic programming and its applications. Journal of Logic Programming, 12:335–367, 1992.

    Google Scholar 

  13. J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 2 edition, 1988.

    Google Scholar 

  14. J.J. Lu. Logic Programming with Signs and Annotations. Journal of Logic and Computation. to appear.

    Google Scholar 

  15. J.J. Lu, N.V. Murray, and E. Rosenthal. Signed formulas and fuzzy operator logics. In Proceedings of the International Symposium on Methodologies for Intelligent Systems. Springer-Verlag, 1994.

    Google Scholar 

  16. J.P. Martins and S.C. Shapiro. A model for belief revision. Artificial Intelligence, 35:25–79, 1988.

    Google Scholar 

  17. N.V. Murray and E. Rosenthal. Adapting classical inference techniques to multiple-valued logics using signed formulas. Fundamenta Informatica, 21:237–253, 1994.

    Google Scholar 

  18. V. Saraswat. Concurrent Constraint Programming. PhD thesis, Carnegie-Mellon, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Institute for Algorithms and Cognitive Systems, University of Karlsruhe, Germany

    Jacques Calmet & Joachim Schü

  2. Department of Computer Science, Bucknell University, Germany

    James J. Lu & Maria Rodriguez

Authors
  1. Jacques Calmet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. James J. Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maria Rodriguez
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Joachim Schü
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zbigniew W. Raś Maciek Michalewicz

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Calmet, J., Lu, J.J., Rodriguez, M., Schü, J. (1996). Signed formula logic programming: Operational semantics and applications (extended abstract). In: Raś, Z.W., Michalewicz, M. (eds) Foundations of Intelligent Systems. ISMIS 1996. Lecture Notes in Computer Science, vol 1079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61286-6_145

Download citation

  • DOI: https://doi.org/10.1007/3-540-61286-6_145

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61286-5

  • Online ISBN: 978-3-540-68440-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation