Minimal answer computation and SOL

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2424, Issue , 2002, Pages 245-258

  Iwanuma, Koji ^a   Inoue, Katsumi ^b  

^a UNIVERSITY OF YAMANASHI   (Japan)

^b KOBE UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CALCULATIONS; SOLS;

COMPUTATION PROBLEMS; COMPUTATIONAL PROBLEM; FUNCTION SYMBOLS; MEMBERSHIP PROBLEM; MINIMAL ANSWERS; UNDECIDABILITY;

COMPUTATION THEORY;

EID: 77952041457     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (23)

1. P. Baumgartner, U. Furbach and F. Stolzenburg: Computing answers with model elimination, Artificial Intelligence 90 (1997) 135-176.
2. D. T. Burhans and S. C. Shapiro: Abduction and question answering, Proc. of IJCAI-01 Workshop on Abductive Reasoning (2001).
3. A. del Val: A new method for consequence finding and compilation in restricted languages, Proc. of AAAI-99 (1999) 259-264.
4. R. Demolombe: A strategy for the computation of conditional answers, Proc. of ECAI 92, LNAI, 810 (1992) 134-138.
5. R. Demolombe and L. F. D. Cerro: An inference rule for hypothesis generation, Proc. of IJCAI-91 (1991) 152-157.
6. C. Green: Theorem proving by resolution as a basis for question-answering systems, in: B. Meltzer and D. Michie (eds), Machine Intelligence 4 (1969) 183-205.
7. C. Green: Application of theorem proving to problem solving. Proc. of IJCAI-69, (1969) 219-239.
8. N. Helft, K. Inoue and D. Poole: Query answering in circumscription, Proc. of IJCAI-91 (1991) 426-431.
9. T. Imielinski: Intelligent query answering in rule based systems, J. Logic Programming 4 (1987) 229-257.
10. K. Inoue: Linear resolution for consequence finding, Artificial Intelligence 56 (1992) 301-353.
11. K. Inoue: Induction, abduction, and consequence-finding, Inductive Logic Programming: Proc. of the 11th ILP, LNAI 2157 (2001) 65-79.
12. K. Iwanuma: Lemma matching for a PTTP-based top-down theorem prover, Proc. of CADE-14, LNAI 1249 (1997) 146-160.
13. K. Iwanuma, K. Inoue and K. Satoh: Completeness of pruning methods for consequence finding procedure SOL, Proc. of FTP 2000 (2000) 89-100.
14. K. Kunen: The semantics of Answer Literals, J. Automated Reasoning 17 (1996) 83-95.
15. R. Letz: Clausal tableaux, in: W. Bibel, P. H. Schmitt, eds., Automated Deduction. A basis for applications, Vol.1, (Kluwer, 1998) 39-68.
16. J. Lobo, J. Minker and A. Rajasekar: Foundations of Disjunctive Logic Programming (MIT Press, 1992).
17. D. W. Loveland: Automated Theorem Proving: A Logical Basis (North-Holland, Amsterdam, 1978).
18. P. Marquis: Extending abduction from propositional to first-order logic, Proc. of Inter. WS. on Fundamentals of Artificial Intelligent Research, LNAI 535 (1991) 141-155.
19. S-H. Nienhuys-Cheng and R. de Wolf: Foundations of Inductive Logic Programming, LNAI 1228 (1997).
20. P. Siegel: Représentation et utilization de la connaissance en calcul propositionnel, Thèse d'État, Université d'Aix-Marseille II, Luminy, France, 1987 (in French).
21. R. E. Shostak: Refutation graphs, Artificial Intelligence 7 (1976) 51-64.
22. M. E. Stickel: A prolog technology theorem prover: Implementation by an extended prolog compiler, J. Automated Reasoning 4 (1988) 353-380.
23. H. Tamaki and T. Sato: OLD Resolution with tabulation, Proc. the 4th ICLP, (1986) 74-103.