On some tractable classes in deduction and abduction

Artificial Intelligence

Volumn 116, Issue 1-2, 2000, Pages 297-313

  Del Val, Alvaro ^a  

^a UNIVERSIDAD AUTÓNOMA DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

KNOWLEDGE REPRESENTATION; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

ABDUCTION; AUTOMATED REASONING; DEDUCTION; ENTAILMENT; PROPOSITIONAL LOGIC; TRACTABLE INFERENCE;

ARTIFICIAL INTELLIGENCE;

EID: 0033907490     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(99)00088-0     Document Type: Article

References (19)

1. Boros E., Crama Y., Hammer P.L. Polynomial inference of all valid implications for Horn and related formulas. Ann. Math. Artificial Intelligence. 1:1990;21-32.
2. Cadoli M., Donini F.M. A survey on knowledge compilation. AI Communications - The European Journal for Artificial Intelligence. 10:1997;137-150.
3. Chandru V., Hooker J.N. Extended Horn sets in propositional logic. J. ACM. 38:1991;205-221.
4. Clark K.L. Negation as failure. Ginsberg M.L. Readings in Non-Monotonic Reasoning. 1978;Morgan Kaufmann, San Mateo, CA.
5. Conforti M., Cornuéjols G. A class of logical inference problems solvable by linear programming. Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science. 1992;670-675.
6. Console L., Dupre D.T., Torasso P. On the relationship between abduction and deduction. J. Logic Programming. 5:1991;661-690.
7. Dalal M. Anytime families of tractable propositional reasoners. Proceedings of the Fourth International Symposium on Artificial Intelligence and Mathematics. 1996;42-45.
8. Dalal M., Etherington D.W. A hierarchy of tractable satisfiability problems. Inform. Process. Lett. 44:1992;173-180.
9. Dechter R., Rish I. Directional resolution: The Davis-Putnam procedure, revisited. Doyle J., Sandewall E., Torassi P. Proceedings of Fourth International Conference on Principles of Knowledge Representation and Reasoning (KR-94), Bonn, Germany. 1994;134-145 Morgan Kaufmann, San Mateo, CA.
10. del Val A. Tractable databases: How to make propositional unit resolution complete through compilation. Doyle J., Sandewall E., Torassi P. Proceedings of Fourth International Conference on Principles of Knowledge Representation and Reasoning (KR-94), Bonn, Germany. 1994;551-561 Morgan Kaufmann, San Mateo, CA.
11. Eiter T., Kilpeläinen T., Mannila H. Recognizing renamable generalized propositional Horn formulas is NP-complete. Discrete Appl. Math. 59:(2):1995;23-32.
12. Eiter T., Gottlob G. The complexity of logic-based abduction. J. ACM. 42:(1):1995;3-42.
13. Esghi K. A tractable class of abduction problems. Proc. IJCAI-93, Chambéry, France. 1993.
14. Henschen L., Wos L. Unit refutations and Horn sets. J. ACM. 21:1974;590-605.
15. Konolige K. Abduction versus closure in clausal theories. Artificial Intelligence. 53:1992;255-272.
16. Lewis H.R. Renaming a set of clauses as a Horn set. J. ACM. 25:(1):1978;134-135.
17. Papadimitriou C.H. Computational Complexity. 1994;Addison-Wesley, Reading, MA.
18. Pretolani D. Hierarchies of polynomially solvable satisfiability problems. Ann. Math. Artificial Intelligence. 17:1996;339-357.
19. Selman B., Levesque H.J. Support set selection for abductive and default reasoning. Artificial Intelligence. 82:1996;259-272.