On computing all abductive explanations

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2002, Pages 62-67

  Eiter, Thomas ^a   Makino, Kazuhisa ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIALS; SEMANTICS; SET THEORY; SYNTACTICS; THEOREM PROVING;

TRACTABILITY;

COMPUTATIONAL COMPLEXITY;

EID: 0036932138     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Bioch, C., and Ibaraki, T. 1995. Complexity of identification and dualization of positive Boolean functions. Information and Computation 123:50-63.
2. Boros, E.; Crama, Y.; and Hammer, P. L. 1990. Polynomial-time inference of all valid implications for Horn and related formulae. Annals of Mathematics & Artificial Intelligence 1:21-32.
3. Brewka, G.; Dix, J.; and Konolige, K. 1997. Nonmonotonic Reasoning - An Overview. Number 73 in CSLI Lecture Notes. CSLI Publications, Stanford University.
4. Dechter, R., and Pearl, J. 1992. Structure identification in relational data. Artificial Intelligence 58:237-270.
5. del Val, A. 2000. The complexity of restricted consequence finding and abduction. In Proc. AAAI-00, 337-342.
6. Eiter, T., and Gottlob, G. 1995. The complexity of logic-based abduction. J. ACM 42(1)3-42.
7. Eiter, T., and Makino, K. 2002. On computing all abductive explanations (preliminary report). Technical Report INFSYS RR-1843-02-04, Institut für Informationssysteme, TU Wien, Austria.
8. Eiter, T.; Gottlob, G.; and Makino, K. 2002. New results on monotone dualization and generating hypergraph transversals. In Proc. 34th ACM Symp. on Theory of Computing (STOC 2002).
9. Fredman, M., and Khachiyan, L. 1996. On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms 21:618-628.
10. Inoue, K. 1992. Linear resolution for consequence finding. Artificial Intelligence 56(2-3):301-354.
11. Kautz, H.; Kearns, M.; and Selman, B. 1993. Reasoning with characteristic models. In Proc. AAAI-93, 34-39.
12. Khardon, R., and Roth, D. 1996. Reasoning with models. Artificial Intelligence 87(1/2):187-213.
13. Khardon, R.; Mannila, H.; and Roth, D. 1999. Reasoning with examples: Prepositional formulae and database dependencies. Acta Informatica 36(4):267-286.
14. Lucchesi, C. L., and Osborn, S. 1978. Candidate keys for relations. J. Computer and System Sciences 17:270-279.
15. Papadimitriou, C. H. 1994. Computational Complexity.
16. Poole, D. 1989. Explanation and prediction: An architecture for default and abductive reasoning. Comp. Intelligence 5(1):97-110.
17. Selman, B., and Levesque, H. J. 1990. Abductive and default reasoning: A computational core. In Proc. AAAI-90, 343-348.
18. Selman, B., and Levesque, H. J. 1996. Support set selection for abductive and default reasoning. Artif. Intell. 82:259-272.