Abstract
In this paper, we integrate monotonic preorders in tableaux using a simultaneous rigid unification calculus. For the case where monotonicity is not considered, we have defined a sound, complete and terminating calculus which has been improved by using rewrite techniques. Moreover we present a sound, complete but not terminating calculus to solve simultaneous rigid monotonic preordered problems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bachmair, L., Ganzinger, H.: Rewrite techniques for transitive relations. In: Procs. LICS 1994, pp. 384–393. IEEE Computer Science Press, Los Alamitos (1994)
Bachmair, L., Ganzinger, H., Lynch, C., Snyder, W.: Basic paramodulation and su- perposition. In: Kapur, D. (ed.) CADE 1992. LNCS (LNAI), vol. 607, pp. 462–476. Springer, Heidelberg (1992)
Bachmair, L., Ganzinger, H., Lynch, C., Snyder, W.: Basic paramodulation. Information and Computation 121, 172–192 (1995)
Degtyarev, A., Voronkov, A.: What you always wanted to know about rigid E- unification. Journal of Automated Reasoning 20(1), 47–80 (1998)
Fitting, M.: First-Order Logic and Automated Theorem Proving, 2nd edn. Springer, Heidelberg (1996)
Gavilanes, A., Leach, J., Martín, P.J., Nieva, S.: Semantic Tableaux for a Logic with Preorders and Dynamic Declarations. In: Galmiche, D. (ed.) TABLEAUX 1997. LNCS, vol. 1227, pp. 7–12. Springer, Heidelberg (1997)
Gallier, J., Narendran, P., Plaisted, D., Snyder, W.: Rigid E-unification: NP- completeness and applications to equational matings. Information and Computation 87(1/2), 129–195 (1990)
Levy, J., Agustí, J.: Bi-rewrite systems. J. Symbolic Computation 22, 279–314 (1996)
Nieuwenhuis, R., Rubio, A.: Theorem Proving with Ordering and Equality Constrained Clauses. J. Symbolic Computation 19, 321–351 (1995)
Nieuwenhuis, R.: Simple LPO constraint solving methods. Information Processing Letters 47, 65–69 (1993)
Rusinowitch, M.: Theorem proving with resolution and superposition. J. Symbolic Computation 11, 21–49 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martín, P.J., Gavilanes, A. (2000). Monotonic Preorders for Free Variable Tableaux. In: Dyckhoff, R. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2000. Lecture Notes in Computer Science(), vol 1847. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722086_25
Download citation
DOI: https://doi.org/10.1007/10722086_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67697-3
Online ISBN: 978-3-540-45008-5
eBook Packages: Springer Book Archive