Abstract
The paper presents a modular superposition calculus for the combination of first-order theories involving both total and partial functions. Modularity means that inferences are pure, only involving clauses over the alphabet of either one, but not both, of the theories. The calculus is shown to be complete provided that functions that are not in the intersection of the component signatures are declared as partial. This result also means that if the unsatisfiability of a goal modulo the combined theory does not depend on the totality of the functions in the extensions, the inconsistency will be effectively found. Moreover, we consider a constraint superposition calculus for the case of hierarchical theories and show that it has a related modularity property. Finally we identify cases where the partial models can always be made total so that modular superposition is also complete with respect to the standard (total function) semantics of the theories.
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-based equational theorem proving with selection and simplification. Journal of Logic and Computation 4(3), 217–247 (1994)
Bachmair, L., Ganzinger, H.: Ordered chaining calculi for first-order theories of transitive relations. Journal of the ACM 45(6) (1998)
Bachmair, L., Ganzinger, H., Waldmann, U.: Refutational theorem proving for hierarchic first-order theories. Applicable Algebra in Engineering, Communication and Computing 5(3/4), 193–212 (1994)
Burmeister, P.: A Model Theoretic Oriented Approach to Partial Algebras: Introduction to Theory and Application of Partial Algebras, Part I. Mathematical Research, vol. 31. Akademie-Verlag, Berlin (1986)
Burris, S.: Polynomial time uniform word problems. Mathematical Logic Quarterly 41, 173–182 (1995)
Evans, T.: Embeddability and the word problem. J. London Math. Soc. 28, 76–80 (1953)
Ganzinger, H.: Relating semantic and proof-theoretic concepts for polynomial time decidability of uniform word problems. In: Sixteenth Annual IEEE Symposium on Logic in Computer Science, pp. 81–92. IEEE Computer Society Press, Los Alamitos (2001)
Ghilardi, S.: Quantifier elimination and provers integration. Electronic Notes in Theoretical Computer Science 86(1) (2003)
Grätzer, G.: Universal algebra, 2nd edn. Springer, Heidelberg (1968)
Kerber, M., Kohlhase, M.: A mechanization of strong Kleene logic for partial functions. In: Bundy, A. (ed.) CADE 1994. LNCS (LNAI), vol. 814, pp. 371–385. Springer, Heidelberg (1994)
Kleene, S.C.: Introduction to Metamathematics. D. Van Nostrand Company, Inc., Princeton (1952)
Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems 1(2), 245–257 (1979)
Tinelli, C.: Cooperation of background reasoners in theory reasoning by residue sharing. Journal of Automated Reasoning 30(1), 1–31 (2003)
Tinelli, C., Harandi, M.: A new correctness proof of the Nelson-Oppen combination procedure. In: Baader, F., Schulz, K.U. (eds.) Frontiers of Combining Systems, First International Workshop, Munich, Germany. Applied Logic Series, vol. 3, pp. 103–119. Kluwer Academic Publishers, Dordrecht (1996)
Tinelli, C., Zarba, C.: Combining non-stably infinite theories. Electronic Notes in Theoretical Computer Science 86(1) (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ganzinger, H., Sofronie-Stokkermans, V., Waldmann, U. (2004). Modular Proof Systems for Partial Functions with Weak Equality. In: Basin, D., Rusinowitch, M. (eds) Automated Reasoning. IJCAR 2004. Lecture Notes in Computer Science(), vol 3097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25984-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-25984-8_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22345-0
Online ISBN: 978-3-540-25984-8
eBook Packages: Springer Book Archive