Anytime clausal reasoning

Annals of Mathematics and Artificial Intelligence

Volumn 22, Issue 3-4, 1998, Pages 297-318

  Dalal, Mukesh ^a  

^a Department of Earth and Environmental Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 27144477812     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1018947704302     Document Type: Article

References (23)

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.
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.
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.
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.
14. M. Dalal, Tractable reasoning in knowledge representation systems, Technical Report CUCS-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.
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 prepositional Horn formulae, Journal of Logic Programming 1(3) (1984) 267-284.
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.
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.
22. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).
23. H.J. Levesque, A logic of implicit and explicit belief, in: Proceedings National Conference on Artificial Intelligence (AAAI-84) (1984) pp. 198-202.