Consequence finding and computing answers with defaults

Journal of Intelligent Information Systems

Volumn 26, Issue 1, 2006, Pages 41-58

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

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^b UNIVERSITY OF YAMANASHI   (Japan)

Author keywords

Conditional answers; Consequence finding; Default theory

Indexed keywords

ARTIFICIAL INTELLIGENCE; QUERY LANGUAGES;

CLAUSAL THEORY; CONDITIONAL ANSWERS; CONSEQUENCE FINDING; DEFAULT THEORY; INTELLIGENT SYSTEMS;

COMPUTATION THEORY;

EID: 33645656808     PISSN: 09259902     EISSN: 15737675     Source Type: Journal    
DOI: 10.1007/s10844-006-5450-2     Document Type: Article

References (26)

1. De Giacomo, G. (1996). Intensional query answering by partial evaluation. Journal of Intelligent Information Systems, 7(3), 205-233.
2. de Kleer, J. (1986). An assumption-based TMS. Artificial Intelligence, 28, 127-162.
3. del Val, A. (1999). A new method for consequence finding and compilation in restricted languages. In Proceedings of the AAAI-99, (pp. 259-264). AAAI Press.
4. Demolombe, R. (1992). A strategy for the computation of conditional answers. In Proceedings of the ECAI'92, LNAI810, (pp. 134-138). Springer.
5. Demolombe, R. (1998). Answers about validity and completeness of data: Formal definitions, usefulness and computation technique. In Proceedings of the FQAS'98, LNAI 1495, (pp. 138-147). Springer.
6. Demolombe, R., & Fariñas del Cerro, L. (1991). An inference rule for hypothesis generation. In Proceedings of the IJCAI-91, (pp. 152-157). Morgan Kaufmann.
7. Green, C. (1969). Theorem-proving by resolution as a basis for question-answering systems. In B. Meltzer and S.D. Michie (Eds.), Machine, intelligence, vol 4. (pp. 183-205). Edinburgh University Press.
8. Inoue, K. (1992). Linear resolution for consequence finding. Artificial Intelligence, 56(2/3), 301-353.
9. Inoue, K. (2002). Automated abduction. In A. C. Kakas, and F. Sadri (Eds.), Computational logic: logic programming and beyond - essays in honour of Robert A Kowalski, Part II LNAI 2408, (pp. 311-341). Springer.
10. Inoue, K. (2004). Induction as consequence finding. Machine Learning, 55(2), 109-135.
11. Inoue, K., & Iwanuma, K. (2004). Speculative computation through consequence-finding in Multi-Agent Environments. Annals of Mathematics and Artificial Intelligence, 42(1-3), 255-291.
12. Inoue, K., Iwanuma, K., & Nabeshima, H. (2003). Consequence finding in default theories. In H. Christiansen, M.-S. Hacid, T. Andreasen, and H. L. Larsen (Eds.), Proceedings of the FQAS 2004 LNAI 3055, (pp. 459-472). Springer.
13. Iwanuma, K., & Inoue, K. (2002). Minimal answer computation and SOL. In Proceedings of the JELIA'02 LNAI 2424, (pp. 245-257). Springer.
14. Iwanuma, K., Inoue, K., & Satoh, K. (2000). Completeness of pruning methods for consequence finding procedure SOL. In P. Baumgartner, and H. Zhang (Eds.), Proceedings of the third international workshop on first-order theorem proving (pp. 89-100).
15. Kunen, K. (1996). The semantics of answer literals. Journal of Automated Reasoning, 17, 83-95.
16. Lee, C. T. (1967). 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.
17. Letz, R. (1998). Clausal tableaux. In W. Bibel, and P. H. Schmitt (Eds.), Automated deduction: a basis for applications, vol 1, (pp. 39-68). Kluwer.
18. Linke, T., & Schaub, T. (2000). Alternative foundations for Reiter's default logic. Artificial Intelligence, 124, 31-86.
19. McCarthy, J. (1986). Applications of circumscription to formalizing common-sense knowledge. Artificial Intelligence, 28, 89-116.
20. Mcllaith, S., & Amir, E. (2001). Theorem proving with structured theories. In Proceedings of the IJCAI-2001 (pp. 624-631). Morgan Kaufmann.
21. Nabeshima, H., Iwanuma, K., & Inoue, K. (2003). SOLAR: A consequence finding system for advanced reasoning. In Proceedings of the TABLEAUX 2003, LNAI 2796 (pp. 257-263). Springer.
22. Poole, D. (1988). A logical framework for default reasoning. Artificial Intelligence, 36, 27-41.
23. Reiter, R. (1980). A logic for default reasoning. Artificial Intelligence, 13, 81-132.
24. Reiter, R. (1987). A theory of diagnosis from first principles. Artificial Intelligence, 32, 571-95.
25. Satoh, K., Inoue, K., Iwanuma, K., & Sakama, C. (2000). Speculative computation by abduction under incomplete communication environments. In Proceedings of the Fourth International Conference on MultiAgent Systems, IEEE Computer Society (pp. 263-270).
26. Siegel, P. (1987). Représentation Et Utilization De La Connaissance En Calcul Propositionnel. Thèse d'État, Université d'Aix-Marseille II, Luminy, France (in French).