Abstract
A powerful extension of the tableau method is described. It consists in a new simplification rule allowing to prune the search space and a new way of extracting a model from a given (possibly infinite) branch. These features are combined with a former method for simultaneous search for refutations and models. The possibilities of the new method w.r.t. the original one are clearly stated. In particular it is shown that the method is able to build model for each formula having a model expressible by equational constraints.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P. Baumgartner, U. Furbach, and I. Niemela. Hyper-tableaux. In Logics in AI, JELIA '96. Springer, 1996.
C. Bourely, R. Caferra, and N. Peltier. A method for building models automatically. Experiments with an extension of Otter. In Proceedings of CADE-12, pages 72–86. Springer, 1994. LNAI 814.
F. Bry and A. Yahya. Minimal model generation with positive unit hyperresolution tableaux. In Proceeding of Tableaux'96, LNAI 1071, pages 143–159. Springer, 1996.
R. Caferra and N. Peltier. Model building and interactive theory discovery. In Proceeding of Tableaux'95, LNAI 918, pages 154–168. Springer, 1995.
R. Caferra and N. Peltier. Decision procedures using model building techniques. In Proceeding of Computer Science Logic, GSL'95, pages 130–144. Springer, LNCS 1092, 1996.
R. Caferra and N. Peltier. A significant extension of logic programming by adapting model buildings rules. In Proc. of Extensions of Logic Programming 96, pages 51–65. Springer, LNAI 1050, March 1996.
R. Caferra and N. Zabel. Extending resolution for model construction. In Logics in AI, JELIA '90, pages 153–169. Springer, LNAI 478, 1990.
R. Caferra and N. Zabel. Building models by using tableaux extended by equational problems. Journal of Logic and Computation, 3:3–25, 1993.
H. Comon and P. Lescanne. Equational problems and disunification. Journal of Symbolic Computation, 7:371–475, 1989.
C. Fermüller and A. Leitsch. Hyperresolution and automated model building. Journal of Logic and Computation, 6(2):173–203, 1996.
C. Fermüller, A. Leitsch, T. Tammet, and N. Zamov. Resolution Methods for the Decision Problem. LNAI 679. Springer, 1993.
M. Fujita and Hasegawa. A model generation theorem prover in kl1 using a ramified stack algorithm. In Proceedings of 8th International Conference Symp. Logic Programming, pages 1070–1080, 1991.
H. Gelernter, J. Hansen, and D. Loveland. Empirical explorations of the geometry theorem-proving machine. In J. Siekmann and G. Wrightson, editors, Automation of Reasoning, vol. 1, pages 140–150. Springer, 1983. Originally published in 1960.
S. Klingenbeck. Counter Examples in Semantic Tableaux. PhD thesis, University of Karlsruhe, 1996.
A. Leitsch. Deciding clause classes by semantic clash resolution. Fundamenta Informaticae, 18:163–182, 1993.
D. W. Loveland. Automated Theorem Proving: A Logical Basis, volume 6 of Fundamental Studies in Computer Science. North Holland, 1978.
R. Manthey and F. Bry. SATCHMO: A theorem prover implemented in Prolog. In Proc. of CADE-9, pages 415–434. Springer, LNCS 310, 1988.
N. Peltier. Increasing the capabilities of model building by constraint solving with terms with integer exponents. Research Report IMAG, No 966-1. To appear in the Journal of Symbolic Computation, November 1996.
N. Peltier. Simplifying and generalizing formulae in tableaux. pruning the search space and building models (long version). http://leibniz.imag.fr/ATINF/Nicolas.Peltier, 1996.
S. Reeves. Semantic tableaux as framework for automated theorem-proving. In AISB Conference, pages 125–139, 1987.
J. R. Slagle. Automatic theorem proving with renamable and semantic resolution. Journal of the ACM, 14(4):687–697, October 1967.
J. Slaney. Finder (finite domain enumerator): Notes and guides. Technical report, Australian National University Automated Reasoning Project, Canberra, 1992.
T. Tammet. Using resolution for deciding solvable classes and building finite models. In Baltic Computer Science, pages 33–64. Springer, LNCS 502, 1991.
S. Winker. Generation and verification of finite models and counter-examples using an automated theorem prover answering two open questions. Journal of the ACM, 29(2):273–284, April 1982.
J. Zhang. Search for models of equational theories. In Proceedings of ICYCS-93, pages 60–63, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peltier, N. (1997). Simplifying and generalizing formulae in tableaux. Pruning the search space and building models. In: Galmiche, D. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 1997. Lecture Notes in Computer Science, vol 1227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027423
Download citation
DOI: https://doi.org/10.1007/BFb0027423
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62920-7
Online ISBN: 978-3-540-69046-7
eBook Packages: Springer Book Archive