Abductive and Default Reasoning: A Computational Core

Proceedings of the 8th National Conference on Artificial Intelligence, AAAI 1990

Volumn , Issue , 1990, Pages 343-348

  Selman, Bart ^a   Levesque, Hector J ^a,b  

^a UNIVERSITY OF TORONTO   (Canada)

^b CANADIAN INSTITUTE FOR ADVANCED RESEARCH   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

ABDUCTIVE REASONING; COMPUTATIONAL CORE; DEFAULT LOGIC; DEFAULT REASONING; EXPONENTIAL NUMBERS; EXPONENTIAL TIME; NON-TRIVIAL; NP-HARD; SUBTASK;

COMPUTER CIRCUITS;

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

References (20)

1. Allemang, D., Tanner, M. C., Bylander T., and Josephson, J. R. (1987) On the computational complexity of hypothesis assembly. Proceedings IJCAI-87, Milan, Italy, 1987, 1112-1117.
2. de Kleer, J. (1986a) An assumption-based TMS, Artificial Intelligence, Vol. 28, #2, 1986, 127-162.
3. de Kleer, J. (1986b) Problem solving with the ATMS, Artificial Intelligence, Vol. 28, #2, 1986, 197-224.
4. de Kleer, J. and Williams, B. C. (1989) Diagnosis with behavioral modes. Proceedings IJCAI-89, Detroit, MI, 1989, 1325-1330.
5. Dowling, W. F. and Gallier, J. H. (1984). Linear-time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming, 3, 1984, 267-284.
6. Gabow, H. N., Maheshwari S. N, and Osterweil L. (1976). On two problems in the generation of program test paths. IEEE Trans. Software Enqineerinq, 1976, 227-231.
7. Garey, M. R. and Johnson, D. S. (1979). Computers and Intractability, A Guide to the Theory of NP-Completeness. New York: W. H. Freeman, 1979.
8. Kautz, H. A. and Selman, B. (1989) Hard problems for simple default logics. Proceedings of the First International Conference on Knowledge Representation and Reasoning (KR-89), Toronto, Ont., 1989, 189-197.
9. Levesque, H. J. (1989). A knowledge-level account of abduction. Proceedinqs IJCAI-89, Detroit, MI, 1989, 1061-1067.
10. McAllester, D. (1985). A widely used used truth-maintenance system. MIT, AI-lab memo, 1985.
11. Poole, D. (1988). A methodology for using a default and abductive reasoning system. Technical report, Dept. of Computer Science, University of Waterloo, Waterloo, Ont., 1988.
12. Provan, G. M. (1987). Efficiency analysis of multiplecontext TMSs in scene representation. Proceedings AAAI-87, Seattle, WA, 1987, 173-178.
13. Provan, G. M. (1988). The Computational Complexity of Truth Maintenance System. Technical Report 88-11, University of British Columbia, Department of Computer Science, 1988.
14. Reggia, J. (1983) Diagnostic expert systems based on a set-covering model. International Journal of Man Machine Studies, 19(5), 1983, 437-460.
15. Reiter, R. and de Kleer, J. (1980). Foundations of assumption-based truth maintenance systems. Proceedings AAAI-87, Seattle, WA, 1987, 183-188.
16. Reiter, R. (1987). A theory of diagnosis from first principles. Artificial Intelligence, 32(1), 1987, 57-96.
17. Selman, B. and Kautz, H. A. (1988) The Complexity of Model-Preference Default Theories. Proceedings of the Seventh Biennial Conference of the Canadian Society for Computational Studies of Intelligence (CSCSI-88), Edmonton, Alberta, 1988, 102-109. Extended version to appear in Artificial Intelligence.
18. Selman, B. (1990) Tractable default reasoning. Ph. D. Thesis, Dept. of Computer Science, University of Toronto, Toronto, Ont. (forthcoming.)
19. Stillman (1989) The complexity of Horn theories with normal unary defaults. Technical report, General Electric Research and Development Center, Schenectady, N. Y., 1989.
20. Valiant, R. G. and Vazirani V. V. (1986) NP is as easy as detecting unique solutions. Theoretical Computer Science, #47, 1986, 85-93.