Compilability of Abduction

Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, AAAI 2000

Volumn , Issue , 2000, Pages 349-354

  Liberatore, Paolo ^a   Schaerf, Marco ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

COMPILABILITY; PRACTICAL PROBLEMS;

COMPUTATIONAL COMPLEXITY;

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

References (12)

1. Bylander, T.; Allemang, D.; Tanner, M. C.; and Josephson, J. R. 1989. Some results concerning the computational complexity of abduction. In Proc. of KR'89, 44-54.
2. Cadoli, M.; Donini, F. M.; Liberatore, P.; and Schaerf, M. 1996. Feasibility and unfeasibility of off-line processing. In Proc. of ISTCS'96, 100-109. IEEE Computer Society Press. URL = FTP://FTP.DIS.UNIROMA1.IT/PUB/AI/PAPERS/CADOETAL-96.PS.GZ.
3. Console, L.; Portinale, L.; and Theseider Dupré, D. 1996. Using compiled knowledge to guide and focus abductive diagnosis. IEEE Trans. on Knowledge and Data Engineering 8(5):690-706.
4. Eiter, T., and Gottlob, G. 1995. The complexity of logic-based abduction. J. of the ACM 42(1):3-42.
5. Garey, M. R., and Johnson, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, Ca: W.H. Freeman and Company.
6. Karp, R. M., and Lipton, R. J. 1980. Some connections between non-uniform and uniform complexity classes. In Proc. of STOC'80, 302-309.
7. Kautz, H. A.; Kearns, M. J.; and Selman, B. 1995. Horn approximations of empirical data. Artificial Intelligence 74:129-145.
8. Khardon, R., and Roth, D. 1996. Reasoning with models. Artificial Intelligence 87:187-213.
9. Peirce, C. S. 1955. Abduction and induction. In Buchler, J., ed., Philosophical Writings of Peirce. Dover, New York. chapter 11.
10. Selman, B., and Levesque, H. J. 1990. Abductive and default reasoning: A computational core. In Proc. of AAAI'90, 343-348.
11. Stockmeyer, L. J. 1976. The polynomial-time hierarchy. Theor. Comp. Sci. 3:1-22.
12. Yap, C. K. 1983. Some consequences of nonuniform conditions on uniform classes. Theor. Comp. Sci. 26:287-300.