Using classical theorem-proving techniques for approximate reasoning: Revised report

  • Stefan Brüning
  • Torsten Schaub
Part of the Lecture Notes in Computer Science book series (LNCS, volume 945)


We propose an approach to approximate classical reasoning via well-known theorem-proving techniques. Unlike other approaches, our approach takes into acconnt the interplay of knowledge bases and queries and thus allows for query-sensitive approximate reasoning. We demonstrate that our approach deals extremely well with the examples found in the literature. This reveals that conventional theorem-proving techniques can account for approximate reasoning.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. Cadoli. Semantical and computational aspects of horn approximations. In Proc. of IJCAI, pages 39–45, 1993.Google Scholar
  2. 2.
    M. Cadoli and M. Schaerf. Approximate Entailment. In Proc. of the Conf. of the Ital. Ass. for AI, pages 68–77. Springer, 1991.Google Scholar
  3. 3.
    C. Chang. The decomposition principle for theorem proving systems. In Allerton Conf. on Circuit and System Theory, pages 20–28, U. of Illinois, 1972.Google Scholar
  4. 4.
    W. P. Dowling and J. P. Gallier. Linear-time algorithms for testing the satisfiability of propositional horn formulae. Jour. of Logic Programming, 1:267–284, 1984.Google Scholar
  5. 5.
    M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.Google Scholar
  6. 6.
    H. Kautz and B. Selman. Forming Concepts for Fast Inference. In Proc. of AAAI, 1992.Google Scholar
  7. 7.
    H. Kautz and B. Selman. An empirical evaluation of knowledge compilation. In Proc. of AAAI, 1994.Google Scholar
  8. 8.
    H. Levesque. Logic and the complexity of reasoning. Jour. of Phil. Logic, 17:355–389, 1988.Google Scholar
  9. 9.
    H. R. Lewis. Renaming a Set of Clauses as a Horn Set. Jour. of the ACM, 25(1):134–135, 1978.Google Scholar
  10. 10.
    W. McCune. Otter users' guide. Argonne Nat'l Laboratories, Argonne, 1988.Google Scholar
  11. 11.
    G. Neugebauer. From Horn Clauses to First Order Logic: A Graceful Ascent. Technical Report AIDA-92-21, TH Darmstadt, 1992.Google Scholar
  12. 12.
    J. A. Robinson. Automatic deduction with hyper-resolution. Jour. of Computer Math., 1:227–234, 1965.Google Scholar
  13. 13.
    B. Selman and H. Kautz. Knowlede Compilation Using Horn Approximations. In Proc. of AAAI, 1991.Google Scholar
  14. 14.
    L. Wos, R. Overbeek, E. Lusk, and J. Boyle. Automated Reasoning, Introduction and Applications. Prentice-Hall, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Stefan Brüning
    • 1
  • Torsten Schaub
    • 2
  1. 1.Intellektik, TH DarmstadtDarmstadt
  2. 2.Theoretische Informatik, TH DarmstadtDarmstadt

Personalised recommendations