Modular Proof Systems for Partial Functions with Weak Equality
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.
Unable to display preview. Download preview PDF.
- 2.Bachmair, L., Ganzinger, H.: Ordered chaining calculi for first-order theories of transitive relations. Journal of the ACM 45(6) (1998)Google Scholar
- 7.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)Google Scholar
- 8.Ghilardi, S.: Quantifier elimination and provers integration. Electronic Notes in Theoretical Computer Science 86(1) (2003)Google Scholar
- 10.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)Google Scholar
- 14.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)Google Scholar
- 15.Tinelli, C., Zarba, C.: Combining non-stably infinite theories. Electronic Notes in Theoretical Computer Science 86(1) (2003)Google Scholar