Automatic recognition of tractability in inference relations
Journal of the ACM (JACM)
Ordered chaining calculi for first-order theories of transitive relations
Journal of the ACM (JACM)
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
Cooperation of Background Reasoners in Theory Reasoning by Residue Sharing
Journal of Automated Reasoning
Unification in Extension of Shallow Equational Theories
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
A Mechanization of Strong Kleene Logic for Partial Functions
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Basic Paramodulation and Decidable Theories
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A rewriting approach to satisfiability procedures
Information and Computation - RTA 2001
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Model-Theoretic Methods in Combined Constraint Satisfiability
Journal of Automated Reasoning
Combining Nonstably Infinite Theories
Journal of Automated Reasoning
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Hierarchic reasoning in local theory extensions
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Applications of Hierarchical Reasoning in the Verification of Complex Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic Verification of Combined Specifications: An Overview
Electronic Notes in Theoretical Computer Science (ENTCS)
Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
New results on rewrite-based satisfiability procedures
ACM Transactions on Computational Logic (TOCL)
Locality Results for Certain Extensions of Theories with Bridging Functions
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Theory decision by decomposition
Journal of Symbolic Computation
Verifying CSP-OZ-DC specifications with complex data types and timing parameters
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
An extension of the Knuth-Bendix ordering with LPO-like properties
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
On local reasoning in verification
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Hierarchical reasoning for the verification of parametric systems
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Instantiation Schemes for Nested Theories
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.00 |
The paper presents a modular superposition calculus for the combination of first-order theories involving both total and partial functions. The modularity of the calculus is a consequence of the fact that all the inferences are pure-only involving clauses over the alphabet of either one, but not both, of the theories-when refuting goals represented by sets of pure formulae. 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.