Consequence finding in default theories

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3055, Issue , 2004, Pages 459-472

  Inoue, Katsumi ^a   Iwanuma, Koji ^b   Nabeshima, Hidetomo ^b  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^b UNIVERSITY OF YAMANASHI   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; INTELLIGENT AGENTS; INTELLIGENT SYSTEMS; MULTI AGENT SYSTEMS; SOLS; COMPUTATION THEORY; CONSTRAINT THEORY; LOGIC PROGRAMMING; PROBLEM SOLVING; SET THEORY;

COMMUNICATION ENVIRONMENTS; CONSEQUENCE FINDINGS; DEFAULT THEORY; FIRST ORDER; SKIP-PREFERENCE; SPECULATIVE COMPUTATION;

COMPUTATION THEORY; COMPUTER SCIENCE;

CLAUSAL THEORIES; CONSEQUENCE FINDING; DEFAULT THEORIES;

EID: 9444272946     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-25957-2_36     Document Type: Conference Paper

References (26)

1. de Giacomo, G. Intensional query answering by partial evaluation. Journal of Intelligent Information Systems, 7(3):205-233, 1996.
2. del Val, A. A new method for consequence finding and compilation in restricted languages. In: Proceedings of AAAI-99, pages 259-264, 1999.
3. Demolombe, R. A strategy for the computation of conditional answers. In: Proceedings of ECAI'92, LNAI 810, pages 134-138, Springer, 1992.
4. Demolombe, R. Answers about validity and completeness of data: formal definitions, usefulness and computation technique. In: Proceedings of FQAS'98, LNAI 1495, pages 138-147, Springer, 1998.
5. Demolombe, R. and L. Fari-nas del Cerro. An inference rule for hypothesis generation. In: Proceedings of IJCAI-91, pages 152-157, Morgan Kaufmann, 1991.
6. Green, C. Theorem-proving by resolution as a basis for question-answering systems. In: B. Meltzer and D. Michie, editors, Machine Intelligence, Volume 4, pages 183-205, Edinburgh University Press, 1969.
7. Imielinski, T. Intelligent query answering in rule based systems. Journal of Logic Programming, 4:229-257, 1987.
8. Inoue, K. Linear resolution for consequence finding. Artificial Intelligence, 56:301-353, 1992.
9. Inoue, K. Induction, abduction, and consequence-finding. In: Proceedings of the 11th International Conference on Inductive Logic Programming, LNAI 2157, pages 65-79, Springer, 2001. An extended version is to appear in Machine Learning, 55:109-135, 2004, under the title: Induction as consequence finding.
10. Inoue, K. Automated abduction. In: A.C. Kakas and F. Sadri, editors, Computational Logic: Logic Programming and Beyond-Essays in Honour of Robert A. Kowalski, Part II, LNAI 2408, pages 311-341, Springer, 2002.
11. Inoue, K. and K. Iwanuma. Speculative computation through consequence-finding in multi-agent environments. Annals of Mathematics and Artificial Intelligence, to appear, 2004.
12. Iwanuma, K. and K. Inoue. Minimal answer computation and SOL. In: Proceedings of JELIA'02, LNAI 2424, pages 245-257, Springer, 2002.
13. Iwanuma, K., K. Inoue, and K. Satoh. Completeness of pruning methods for consequence finding procedure SOL. In: Proceedings of the 3rd International Workshop on First-Order Theorem Proving, pages 89-100, 2000.
14. Kunen, K. The semantics of answer literals. Journal of Automated Reasoning, 17:83-95, 1996.
15. Lee, C.T. A completeness theorem and computer program for finding theorems derivable from given axioms. Ph.D. Thesis, Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA, 1967.
16. Letz, R. Clausal tableaux. In: W. Bibel, P. H. Schmitt, editors, Automated Deduction: A Basis for Applications, Volume 1, pages 39-68, Kluwer, 1998.
17. Linke, T. and T. Schaub. Alternative foundations for Reiter's default logic. Artificial Intelligence, 124:31-86, 2000.
18. Marquis, P. Consequence finding algorithms. In: D.M. Gabbay and P. Smets, editors, Handbook for Defeasible Reasoning and Uncertain Management Systems, Volume 5, pages 41-145, Kluwer, 2000.
19. McIlaith, S. and E. Amir. Theorem proving with structured theories. In: Proceedings of IJCAI-2001, pages 624-631, Morgan Kaufmann, 2001.
20. Nabeshima, H., K. Iwanuma, and K. Inoue. SOLAR: a consequence finding system for advanced reasoning. In: Proceedings of TABLEAUX 2003, LNAI 2796, pages 257-263, 2003.
21. Poole, D. A logical framework for default reasoning. Artificial Intelligence, 36:27-47, 1988.
22. Poole, D., R. Goebel, and R. Aleliunas. Theorist: a logical reasoning system for defaults and diagnosis. In: N. Cercone and G. McCalla, editors, The Knowledge Frontier: Essays in the Representation of Knowledge
23. Reiter, R. A logic for default reasoning. Artificial Intelligence, 13:81-132, 1980.
24. Reiter, R. A theory of diagnosis from first principles. Artificial Intelligence, 32:571-95, 1987.
25. Reiter, R. and J. de Kleer. Foundations of assumption-based truth maintenance systems: preliminary report. In: Proceedings of AAAI-87, pages 183-187, Morgan Kaufmann, 1987.
26. Satoh, K., K. Inoue, K. Iwanuma, and C. Sakama. Speculative computation by abduction under incomplete communication environments. In: Proceedings of the Fourth International Conference on MultiAgent Systems, pages 263-270, 2000.