Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Anytime clausal reasoning

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

Given any incomplete clausal propositional reasoner satisfying certain properties, we extend it to a family of increasingly‐complete, sound, and tractable reasoners. Our technique for generating these reasoners is based on restricting the length of the clauses used in chaining (Modus Ponens). Such a family of reasoners constitutes an anytime reasoner, since each propositional theory has a complete reasoner in the family. We provide an alternative characterization, based on a fixed‐point construction, of the reasoners in our anytime families. This fixed‐point characterization is then used to define a transformation of propositional theories into logically equivalent theories for which the base reasoner is complete; such theories are called “vivid”. Developing appropriate notions of vividness and techniques for compiling theories into vivid theories has already generated considerable interest in the KR community. We illustrate our approach by developing an anytime family based on Boolean constraint propagation.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. A.R. Anderson and N.D. Belnap, Entailment, the Logic of Relevance and Neccessity(Princeton University Press, 1975).

  2. N.D. Belnap, A useful four-valued logic, in: Modern Uses of Multiple-Valued Logics, eds. G. Epstein and J.M. Dunn (Reidel, 1977).

  3. M. Boddy and T. Dean, Solving time dependent planning problems, Technical report, Department of Computer Science, Brown University (1988).

  4. H.K. Buning, On generalized Horn formulas and k-resolution, Theoretical Computer Science 116 (1993) 405-413.

    Google Scholar 

  5. M. Cadoli, Panel on knowledge compilation and approximations: terminology, questions, and references, in:Fourth International Symposium on Artificial Intelligence and Mathematics (AI/MATH-96), Florida (1996) pp. 183-186.

  6. M. Cadoli and M. Schaerf, Approximation in concept description languages, in: Principles of Knowledge Representation and Reasoning: Proceedings of the Third International Conference (KR'92), eds. B. Nebel, C. Rich and W. Swartout (Morgan Kaufmann, Cambridge, MA, 1992) pp. 330-341.

    Google Scholar 

  7. S.A. Cook, The complexity of theorem proving procedures, in: Proceedings Third Annual ACM Symposium on the Theory of Computing(1971) pp. 151-158.

  8. J. Crawford, ed., Proceedings of the AAAI Workshop on Tractable Reasoning(American Association for Artificial Intelligence, San Jose, CA, 1992).

  9. J. Crawford and B. Kuipers, Towards a theory of access-limited logic for knowledge representation, in: Proceedings First International Conference on Principles of Knowledge Representation and Reasoning (KR'89)(1989) pp. 67-78.

  10. J.M. Crawford, Personal communication (1994).

  11. J.M. Crawford and B.J. Kuipers, Negation and proof by contradiction in access-limited logic, in: Proceedings Ninth National Conference on Artificial Intelligence (AAAI-91)(1991) pp. 897-903.

  12. M. Dalal, Efficient propositional constraint propagation, in: Proceedings Tenth National Conference on Artificial Intelligence (AAAI-92)(American Association for Artificial Intelligence, San Jose, CA, 1992) pp. 409-414.

    Google Scholar 

  13. M. Dalal, Tractable deduction in knowledge representation systems, in: Principles of Knowledge Representation and Reasoning: Proceedings of the Third International Conference (KR'92), eds. B. Nebel, C. Rich and W. Swartout (Morgan Kaufmann, Cambridge, MA, 1992) pp. 393-402.

    Google Scholar 

  14. M. Dalal, Tractable reasoning in knowledge representation systems, Technical Report CUCS-0 017-95, Department of Computer Science, Columbia University, New York, NY (July 1995). file://ftp.cs.columbia.edu/reports/reports-1995/cucs-017-95.ps.gz.

    Google Scholar 

  15. M. Dalal, Anytime families of tractable propositional reasoners, in: Fourth International Symposium on Artificial Intelligence and Mathematics (AI/MATH-96), Florida (1996) pp. 42-45.

  16. A. del Val, An analysis of approximate knowledge compilation, in: Proceedings Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95)(1995) pp. 830-836.

  17. R. Dionne, E. Mays and F.J. Oles, The equivalence of model-theoretic and structural subsumption in description logics, in: Proceedings Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93)(1993) pp. 710-716.

  18. W.F. Dowling and J.H. Gallier, Linear-time algorithms for testing the satisfiability of propositional Horn formulae, Journal of Logic Programming 1(3) (1984) 267-284.

    Article  MATH  MathSciNet  Google Scholar 

  19. J. Doyle and R. Patil, Two theses of knowledge representation: language restrictions, taxanomic classification, and the utility of representation services, Artificial Intelligence 48(3) (1991) 261-297.

    Article  Google Scholar 

  20. A.M. Frisch, Inference without chaining, in: Proceedings Tenth International Joint Conference on Artificial Intelligence (IJCAI-87)(1987) pp. 515-519.

  21. G. Gallo and M.G. Scutellà, Polynomially solvable satisfiability problems, Information Processing Letters 29 (1988) 221-227.

    Article  MATH  MathSciNet  Google Scholar 

  22. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness(Freeman, New York, 1979).

    Google Scholar 

  23. H.J. Levesque, A logic of implicit and explicit belief, in: Proceedings National Conference on Artificial Intelligence (AAAI-84)(1984) pp. 198-202.

  24. H.J. Levesque, Making believers out of computers, Artificial Intelligence 30 (1986) 81-108.

    Article  MathSciNet  Google Scholar 

  25. J.W. Lloyd, Foundations of Logic Programming(Springer, Berlin, 2 ed., 1987).

    Google Scholar 

  26. P. Marquis, Knowledge compilation using theory prime implicates, in: Proceedings Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95)(1995) pp. 837-843.

  27. D. McAllester, An outlook on truth maintenance, Memo 551, MIT AI Lab (August 1980).

  28. D. McAllester, Truth maintenance, in: Proceedings Eighth National Conference on Artificial Intelligence (AAAI-90)(1990) pp. 1109-1116.

  29. E. Mendelson, Introduction to Mathematical Logic(Van Nostrand, Princeton, NJ, 1964).

    Google Scholar 

  30. R. Reiter and J. de Kleer, Foundations of assumption-based truth maintenance systems: Preliminary report, in: Proceedings Sixth National Conference on Artificial Intelligence (AAAI-87)(1987) pp. 183-188.

  31. B. Selman and H. Kautz, Knowledge compilation using Horn approximations, in: Proceedings Ninth National Conference on Artificial Intelligence (AAAI-91)(1991) pp. 904-909.

  32. A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific J. Math. 5 (1955) 285-309.

    Google Scholar 

  33. H. Zhang and M.E. Stickel, An efficient algorithm for unit propagation, in: Fourth International Symposium on Artificial Intelligence and Mathematics (AI/MATH-96), Florida (1996) pp. 166-169.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Columbia University, New York, NY, 10027, USA

    Mukesh Dalal

Authors
  1. Mukesh Dalal
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dalal, M. Anytime clausal reasoning. Annals of Mathematics and Artificial Intelligence 22, 297–318 (1998). https://doi.org/10.1023/A:1018947704302

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018947704302

Keywords

Search

Navigation