Signed formula logic programming: Operational semantics and applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1079, Issue , 1996, Pages 202-211

  Calmet, Jacques ^a   Lu, James J ^b   Rodriguez, Maria ^b   Schü, Joachim ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b BUCKNELL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; COMPUTER PROGRAMMING LANGUAGES; INTELLIGENT SYSTEMS; SEMANTICS;

BILATTICES; CONSTRAINT LOGIC PROGRAMMING; MULTIPLE VALUED LOGIC; OPERATIONAL SEMANTICS; SIGNED FORMULAS; THEORETICAL FOUNDATIONS; TRUTH MAINTENANCE;

LOGIC PROGRAMMING;

EID: 84949787264     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61286-6_145     Document Type: Conference Paper

References (18)

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.
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.
3. J. DeKleer. An assumption-based TMS. Artificial Intelligence, 28:127-162, 1986.
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 Uncertainty, Proceedings of ECSQARU '93, Granada, Spain, Nov. 1993, volume 747 of Lecture Notes in Computer Science, pages 113-120, Berlin, Heidelberg, 1993. Springer.
5. M. Fitting. Bilattices and the semantics of logic programming. Journal of Logic Programming, 11:91-116, 1991.
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.
7. Dov M. Gabbay. LDS-labelled deductive systems. Preprint, Dept. of Computing, Imperial College, London, September 1989.
8. M.L. Ginsberg. Multivalued logics: A uniform approach to inference in artificial intelligence. Computational Intelligence, 4(3):265-316, 1988.
9. R. Hähnle. Uniform notation of tableau rifles for multiple-valued logics. In Proceedings of the International Symposium on Multiple-Valued Logic, pages 26-29. Computer Society Press, 1991.
10. R. Hähule. Short normal forms for arbitrary finitely-valued logics. In Proceedings of International Symposium on Methodologies]or Intelligent Systems, pages 49-58. Springer-Verlag, 1993.
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.
12. M. Kifer and V.S. Subrahmanian. Theory of generalized annotated logic programming and its applications. Journal of Logic Programming, 12:335-367, 1992.
13. J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 2 edition, 1988.
14. J.J. Lu. Logic Programming with Signs and Annotations. Journal of Logic and Computation. to appear.
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.
16. J.P. Martins and S.C. Shapiro. A model for belief revision. Artificial Intelligence, 35:25-79, 1988.
17. N.V. Murray and E. Rosenthal. Adapting classical inference techniques to multiple-valued logics using signed formulas. Fundamenta lnformatica, 21:237-253, 1994.
18. V. Saraswat. Concurrent Constraint Programming. PhD thesis, Carnegie-Mellon, 1991.