Abstract
In this paper, we study an upside-down transformation of a branch in SOL/Connection tableaux and show that SOL/Connection tableaux using the folding-up operation can always accomplish a size-preserving transformation for any branch in any tableau. This fact solves the exponentially-growing size problem caused both by the order- preserving reduction and by an incremental answer computation problem.
This research was partially supported by the Grant-in-Aid from The Ministry of Education, Science and Culture of Japan ((A)(1) No.13358004) and (B)(1) No.17300051.
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
Baumgartner, P., Furbach, U., Stolzenburg, F.: Computing answers with model elimination. Artificial Intelligence 90, 135–176 (1997)
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)
Inoue, K.: Linear resolution for consequence finding. Artificial Intelligence 56, 301–353 (1992)
Inoue, K.: Automated abduction. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol. 2408, pp. 311–341. Springer, Heidelberg (2002)
Iwanuma, K., Inoue, K., Satoh, K.: Completeness of pruning methods for consequence finding procedure SOL. In: Baumgartner, P., Zhang, H. (eds.) Proceedings of the 3rd International Workshop on First-Order Theorem Proving, pp. 89–100 (2000)
Inoue, K., Iwanuma, K.: Speculative Computation Through Consequence-Finding in Multi-agent Environments. Ann. Math. Artif. Intell. 42(1-3) (2004)
Kunen, K.: The semantics of Answer Literals. J. Automated Reasoning 17, 83–95 (1996)
Letz, R., Goller, C., Mayr, K.: Controlled integration of the cut rule into connection tableau calculi. Journal of Automated Reasoning 13, 297–338 (1994)
Letz, R.: Clausal tableaux. In: Bibel, W., Schmitt, P.H. (eds.) Automated Deduction: A Basis for Applications, vol. 1, pp. 39–68. Kluwer, Dordrecht (1998)
Letz, R.: Using Mating for Pruning Connection Tableaux. In: Kirchner, C., Kirchner, H. (eds.) CADE 1998. LNCS (LNAI), vol. 1421, pp. 381–396. Springer, Heidelberg (1998)
Loveland, D.W.: Automated Theorem Proving: A Logical Basis. North-Holland, Amsterdam (1978)
Marquis, P.: Consequence finding algorithms. In: Gabbay, D.M., Smets, P. (eds.) Handbook for Defeasible Reasoning and Uncertain Management Systems, vol. 5, pp. 41–145. Kluwer Academic, Dordrecht (2000)
Spencer, B.: Avoiding Duplicate Proofs with the Foothold Refinement. Ann. Math. Artif. Intell. 12(1-2), 117–140 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iwanuma, K., Inoue, K., Nabeshima, H. (2005). Upside-Down Transformation in SOL/Connection Tableaux and Its Application. In: Van Hung, D., Wirsing, M. (eds) Theoretical Aspects of Computing – ICTAC 2005. ICTAC 2005. Lecture Notes in Computer Science, vol 3722. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560647_11
Download citation
DOI: https://doi.org/10.1007/11560647_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29107-7
Online ISBN: 978-3-540-32072-2
eBook Packages: Computer ScienceComputer Science (R0)