Advertisement

Non-clausal reasoning with propositional definite theories

  • Zbigniew Stachniak
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1476)

Abstract

In this paper we propose a non-clausal representational formalism (of definite formulas) that retains the syntactic flavor and algorithmic advantages of Horn clauses. The notion of a definite formula is generic in the sense that it is available to any logical calculus. We argue that efficient automated reasoning techniques which utilize definite formula representation of knowledge (such as SLD-resolution) can be developed for classical and a variety of non-classical logics.

Keywords

Classical Logic Conjunctive Normal Form Reduction Rule Horn Clause Classical Propositional Logic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    HÄhnle, R., Murray, N. and Rosenthal, E.: Completeness for Linear Regular Negation Normal Form Inference Systems. State University of New York, Albany, Technical Report 97-2 (1997).Google Scholar
  2. 2.
    Lloyd, J. W.: Foundations of Logic Programming, 2nd ed. Springer-Verlag (1987).Google Scholar
  3. 3.
    Malinowski, G.: Many-Valued Logics. Oxford University Press (1993).Google Scholar
  4. 4.
    Manna, Z. and Waldinger, R.: Special Relations in Automated Deduction. J. ACM 33 (1986) 1–59.zbMATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    McAllester, D.: Truth Maintenance. Proc. AAAI-90 (1990) 1109–1116.Google Scholar
  6. 6.
    Murray, N.: Completely Non-Clausal Theorem Proving. Artificial Intelligence 18 (1982) 67–85.zbMATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    Robinson, J.A.: A Machine-Oriented Logic Based on the Resolution Principle. J. ACM 12 (1965) 23–41.zbMATHCrossRefGoogle Scholar
  8. 8.
    Roy-Chowdhury, R. and Dalai, M.: Model Theoretic Semantics and Tractable Algorithm for CNF-BCP. Proc. AAAI-97 (1997) 227–232.Google Scholar
  9. 9.
    Shankar, S. and Slage, J.: Connection Based Strategies for Deciding Prepositional Temporal Logic. Proc. AAAI-97 (1997) 172–177.Google Scholar
  10. 10.
    Stachniak, Z.: Resolution Proof Systems: An Algebraic Theory. Kluwer Academic Publishers (1996).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Zbigniew Stachniak
    • 1
  1. 1.York UniversityTorontoCanada

Personalised recommendations