Model-Theoretic Methods in Combined Constraint Satisfiability

Authors:
Silvio Ghilardi
Affiliations:
Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, Italy
Venue:
Journal of Automated Reasoning
Year:
2004

Citing 12
Cited 32

The complexity of linear problems in fields

Journal of Symbolic Computation
On restrictions of ordered paramodulation with simplification

CADE-10 Proceedings of the tenth international conference on Automated deduction
Term rewriting and all that

Term rewriting and all that
Reasoning About Recursively Defined Data Structures

Journal of the ACM (JACM)
Simplification by Cooperating Decision Procedures

ACM Transactions on Programming Languages and Systems (TOPLAS)
A General Setting for Flexibly Combining and Augmenting Decision Procedures

Journal of Automated Reasoning
Cooperation of Background Reasoners in Theory Reasoning by Residue Sharing

Journal of Automated Reasoning
Unions of non-disjoint theories and combinations of satisfiability procedures

Theoretical Computer Science
A Tableau Calculus for Combining Non-disjoint Theories

TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Combining Decision Procedures for Positive Theories Sharing Constructors

RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
A New Approach for Combining Decision Procedure for the Word Problem, and Its Connection to the Nelson-Oppen Combination Method

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Combining word problems through rewriting in categories with products

Theoretical Computer Science - Category theory and computer science

A new combination procedure for the word problem that generalizes fusion decidability results in modal logics

Information and Computation - Special issue: Combining logical systems
Modular proof systems for partial functions with Evans equality

Information and Computation - Special issue: Combining logical systems
Decision procedures for term algebras with integer constraints

Information and Computation - Special issue: Combining logical systems
Applications of Hierarchical Reasoning in the Verification of Complex Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
Decision procedures for extensions of the theory of arrays

Annals of Mathematics and Artificial Intelligence
A comprehensive combination framework

ACM Transactions on Computational Logic (TOCL)
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
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
Noetherianity and Combination Problems

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)
Ground Interpolation for the Theory of Equality

TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Satisfiability Procedures for Combination of Theories Sharing Integer Offsets

TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis

Annals of Mathematics and Artificial Intelligence
Decision procedures for algebraic data types with abstractions

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verifying CSP-OZ-DC specifications with complex data types and timing parameters

IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Data structures with arithmetic constraints: a non-disjoint combination

FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Combining theories with shared set operations

FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
On theorem proving for program checking: historical perspective and recent developments

Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Ordered sets in the calculus of data structures

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
A declarative two-level framework to specify and verify workflow and authorization policies in service-oriented architectures

Service Oriented Computing and Applications
Modular termination and combinability for superposition modulo counter arithmetic

FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
A Decidability Result for the Model Checking of Infinite-State Systems

Journal of Automated Reasoning
Deciding extensions of the theory of arrays by integrating decision procedures and instantiation strategies

JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Decidability and undecidability results for nelson-oppen and rewrite-based decision procedures

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Invited contribution: a comprehensive framework for combined decision procedures

FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Connecting many-sorted structures and theories through adjoint functions

FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Connecting many-sorted theories

CADE' 20 Proceedings of the 20th international conference on Automated Deduction
On hierarchical reasoning in combinations of theories

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
On the verification of security-aware E-services

Journal of Symbolic Computation
From strong amalgamability to modularity of quantifier-free interpolation

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Quantifier-free interpolation in combinations of equality interpolating theories

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We extend the Nelson--Oppen combination procedure to the case of theories that are compatible with respect to a common subtheory in the shared signature. The notion of compatibility relies on model completions and related concepts from classical model theory.