# Modular Proof Systems for Partial Functions with Weak Equality

@inproceedings{Ganzinger2004ModularPS,
title={Modular Proof Systems for Partial Functions with Weak Equality},
author={Harald Ganzinger and Viorica Sofronie-Stokkermans and Uwe Waldmann},
booktitle={IJCAR},
year={2004}
}
• Published in IJCAR 4 July 2004
• Mathematics
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…
16 Citations

### Reasoning in combinations of theories

The reductive approach outlined above has become particularly relevant in recent years due to the rise of powerful solvers for background theories common in verification tasks.

### On Hierarchical Reasoning in Combinations of Theories

• Mathematics
IJCAR
• 2010
It is shown that combinations of extensions of theories which are local in this extended sense also have a locality property and hence allow modular and hierarchical reasoning and hence obtain parameterized decidability and complexity results for many (combinations of) theories important in verification.

### Hierarchical Reasoning in Local Theory Extensions and Applications

• Viorica Sofronie-Stokkermans
• Computer Science
2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
• 2014
The way the authors used the possibility of hierarchical reasoning in local theory extensions in various application areas such as automated reasoning in mathematics, verification of reactive, real time and hybrid systems, and description logics is discussed.

### Combining Non-Stably Infinite Theories

• Mathematics
Electron. Notes Theor. Comput. Sci.
• 2003

### Combining Nonstably Infinite Theories

• Mathematics
Journal of Automated Reasoning
• 2005
Two extensions of the Nelson–Oppen method are described that address the problem of combining theories that are not stably infinite, and exchange not only equalities between shared variables but also certain cardinality constraints.

### Hierarchic Reasoning in Local Theory Extensions

It is shown that for special types of extensions of a base theory, which is called local, efficient hierarchic reasoning is possible, for an extension of a theory, to express the decidability and complexity of the universal theory of $\mathcal{T}_{1}$ in terms of the decideability resp.

### System Description: H-PILoT (Version 1.9)

• Computer Science
ArXiv
• 2010
H-PILoT (Hierarchical Proving by Instantiation in Local Theory extensions) provides a decision procedure for testing satisfiability of ground formulae, and can also be used for model generation.

### On Invariant Synthesis for Parametric Systems

• Mathematics, Computer Science
• 2019
An algorithm for symbol elimination in theory extensions is used to devise a method for iteratively strengthening certain classes of safety properties to obtain invariants of the system.

## References

SHOWING 1-10 OF 26 REFERENCES

### Refutational theorem proving for hierarchic first-order theories

• Mathematics, Computer Science
Applicable Algebra in Engineering, Communication and Computing
• 2005
It is shown that superposition together with variable abstraction and constraint refutation is refutationally complete for theories that are sufficiently complete with respect to simple instances, and the concept of approximation between theorem proving systems is introduced.

### A Mechanization of Strong Kleene Logic for Partial Functions

• Philosophy, Computer Science
• 1994
This paper presents a resolution calculus that combines the proper treatment of partial functions with the efficiency of sorted calculi, and applies recent methods from sorted logics.

### Rewrite-Based Equational Theorem Proving with Selection and Simplification

• Computer Science
J. Log. Comput.
• 1994
This paper forms an abstract notion of redundancy and shows that the deletion of redundant clauses during the theorem proving process preserves refutation completeness, and presents various refutationally complete calculi for first-order clauses with equality that allow for arbitrary selection of negative atoms in clauses.

### Ordered chaining calculi for first-order theories of transitive relations

• Computer Science
JACM
• 1998
It is demonstrated that rewrite techniques considerably restrict variable chaining and that further restrictions are possible if the transitive relation under consideration satisfies additional properties, such as symmetry.

### A New Correctness Proof of the {Nelson-Oppen} Combination Procedure

• Mathematics
FroCoS
• 1996
The correctness proof of the procedure is given, which constitutes a novel and easier proof of Nelson and Oppen’s original results, and shows that equality sharing between the satisfiability procedures of the component theories can be confined to a restricted set of variables.

### E-Resolution: Extension of Resolution to Include the Equality Relation

The E-Resolution inference principle is a single-inference logic system for the first-order predicate calculus with equality, where special axioms for equality are not required to be added to the original set of clauses.

### Basic paramodulation and decidable theories

• R. Nieuwenhuis
• Mathematics
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science
• 1996
We prove that for sets of Horn clauses saturated under basic paramodulation, the word and unifiability problems are in NP, and the number of minimal unifiers is simply exponential (i). For Horn sets

### Combining Non-Stably Infinite Theories

• Mathematics
Electron. Notes Theor. Comput. Sci.
• 2003

### Hierarchic Reasoning in Local Theory Extensions

It is shown that for special types of extensions of a base theory, which is called local, efficient hierarchic reasoning is possible, for an extension of a theory, to express the decidability and complexity of the universal theory of $\mathcal{T}_{1}$ in terms of the decideability resp.