SOLAR: A consequence finding system for advanced reasoning

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

Volumn 2796, Issue , 2003, Pages 257-263

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

^a UNIVERSITY OF YAMANASHI   (Japan)

^b KOBE UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 7044253727     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45206-5_22     Document Type: Conference Paper

References (18)

1. del Val, A.: A new method for consequence finding and compilation in restricted languages. In: Proceedings of AAAI-99. (1999) 259–264
2. Inoue, K.: Linear resolution for consequence finding. Artificial Intelligence 56(1992) 301–353
3. Minicozzi, E., Reiter, R.: A note on linear resolution strategies in consequencefinding. Artificial Intelligence 3(1972) 175–180
4. Slagle, J. R., Chang, C., Lee, R.C.: Completeness theorems for semantic resolution in consequence-finding. In: Proceedings of IJCAI-69. (1969) 281–285
5. Iwanuma, K., Inoue, K., Satoh, K.: Completeness of pruning methods for consequence finding procedure SOL. In: Proceedings of FTP-2000. (2000) 89–100
6. Iwanuma, K., Inoue, K.: Conditional answer computation in SOL as speculative computation in multi-agent environments. In: Proceedings of CLIMA-02. (2002) 149–162 (It also appears in Electronic Notes on Theoretical Computer Science 70(5), 2002)
7. Yamamoto, A.: Representing inductive inference with SOLD-resolution. In: Proceedings of IJCAI-97 Workshop on Abduction and Induction in AI. (1997) 59–63
8. Inoue, K.: Induction, abduction, and consequence-finding. In: Proceedings of ILP-01. Volume 2157 of LNAI., Springer (2001) 65–79
9. Reiser, P., King, R.D., Kell, D. B., Muggleton, S.H., Bryant, C.H., Oliver, S.G.: Developing a logical model of yeast metabolism. Electronic Transactions on Artificial Intelligence 5(2001) 223–244
10. McIlraith, S., Amir, E.: Theorem proving with structured theories. In: Proceedings of IJCAI-01. (2001) 624–631
11. Loveland, D.W.: Automated Theorem Proving: a logical basis. North-Holland Publishing Company, Amsterdam (1978)
12. Siegel, P.: Représentation et utilization de la connaissance en calcul propositionnel. Thèse d’État, Université d’Aix-Marseille II, Luminy, France (1987) (in French)
13. Letz, R.: Clausal tableaux. In Bibel, W., Schmitt, P.H., eds.: Automated Deduction - A Basis for Applications. Volume I: Foundations. Kluwer, Dordrecht (1998) 39–68
14. Letz, R., Goller, C., Mayr, K.: Controlled integration of the cut rule into connection tableau calculi. Journal of Automated Reasoning 13(1994) 297–338
15. McCune, W.: Experiments with discrimination-tree indexing and path indexing for term retrieval. Journal of Automated Reasoning 9(1992) 147–167
16. Sutcliffe, G., Suttner, C.: The TPTP problem library for automated theorem proving v2.5.0. http://www.tptp.org/ (2002)
17. McCune, W.: OTTER3.0 reference manual and guide. Technical Report ANL-94/6, Argonne National Laboratory (1994)
18. Simon, L., del Val, A.: Efficient consequence finding. In: Proceedings of IJCAI-01. (2001) 359–370