Abstract
SOLAR is an efficient first-order consequence finding system based on a connection tableau format with Skip operation. Consequence finding 1,2,3,4 is a generalization of refutation finding or theorem proving, and is useful for many reasoning tasks such as knowledge compilation, inductive logic programming, abduction. One of the most significant calculus of consequence finding is SOL 2. SOL is complete for consequence finding and can find all minimal-length consequences with respect to subsumption. SOLAR (SOL for Advanced Reasoning) is an efficient implementation of SOL and can avoid producing non-minimal/redundant consequences due to various state of the art pruning methods, such as skip-regularity, local failure caching, folding-up (see 5,6).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
del Val, A.: A new method for consequence finding and compilation in restricted languages. In: Proceedings of AAAI 1999, 259–264 (1999)
Inoue, K.: Linear resolution for consequence finding. Artificial Intelligence 56, 301–353 (1992)
Minicozzi, E., Reiter, R.: A note on linear resolution strategies in consequence-finding. Artificial Intelligence 3, 175–180 (1972)
Slagle, J.R., Chang, C., Lee, R.C.: Completeness theorems for semantic resolution in consequence-finding. In: Proceedings of IJCAI 1969, 281–285 (1969)
Iwanuma, K., Inoue, K., Satoh, K.: Completeness of pruning methods for consequence finding procedure SOL. In: Proceedings of FTP 2000, 89–100 (2000)
Iwanuma, K., Inoue, K.: Conditional answer computation in SOL as speculative computation in multi-agent environments. In: Proceedings of CLIMA 2002, pp. 149–162 (2002); It also appears in Electronic Notes on Theoretical Computer Science 70(5) (2002)
Yamamoto, A.: Representing inductive inference with SOLD-resolution. In: Proceedings of IJCAI 1997 Workshop on Abduction and Induction in AI, pp. 59–63 (1997)
Inoue, K.: Induction, abduction, and consequence-finding. In: Rouveirol, C., Sebag, M. (eds.) ILP 2001. LNCS (LNAI), vol. 2157, pp. 65–79. Springer, Heidelberg (2001)
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, 223–244 (2001)
McIlraith, S., Amir, E.: Theorem proving with structured theories. In: Proceedings of IJCAI 2001, pp. 624–631 (2001)
Loveland, D.W.: Automated Theorem Proving: a logical basis. North-Holland Publishing Company, Amsterdam (1978)
Siegel, P.: Représentation et utilization de la connaissance en calcul propositionnel. In: Thése d’État, Université d’Aix-Marseille II, Luminy, France (1987) (in French)
Letz, R.: Clausal tableaux. In: Bibel, W., Schmitt, P.H. (eds.) Automated Deduction - A Basis for Applications. Foundations, vol. I, pp. 39–68. Kluwer, Dordrecht (1998)
Letz, R., Goller, C., Mayr, K.: Controlled integration of the cut rule into connection tableau calculi. Journal of Automated Reasoning 13, 297–338 (1994)
McCune, W.: Experiments with discrimination-tree indexing and path indexing for term retrieval. Journal of Automated Reasoning 9, 147–167 (1992)
Sutcliffe, G., Suttner, C.: The TPTP problem library for automated theorem proving v2.5.0 (2002), http://www.tptp.org/
McCune, W.: OTTER3.0 reference manual and guide. Technical Report ANL- 94/6, Argonne National Laboratory (1994)
Simon, L., del Val, A.: Efficient consequence finding. In: Proceedings of IJCAI 2001, pp. 359–370 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nabeshima, H., Iwanuma, K., Inoue, K. (2003). SOLAR: A Consequence Finding System for Advanced Reasoning. In: Cialdea Mayer, M., Pirri, F. (eds) Automated Reasoning with Analytic Tableaux and Related Methods . TABLEAUX 2003. Lecture Notes in Computer Science(), vol 2796. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45206-5_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-45206-5_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40787-4
Online ISBN: 978-3-540-45206-5
eBook Packages: Springer Book Archive