Unions of non-disjoint theories and combinations of satisfiability procedures
From MaRDI portal
(Redirected from Publication:1853591)
Recommendations
Cites work
- scientific article; zbMATH DE number 3888893 (Why is no real title available?)
- scientific article; zbMATH DE number 3898849 (Why is no real title available?)
- scientific article; zbMATH DE number 4049130 (Why is no real title available?)
- scientific article; zbMATH DE number 44486 (Why is no real title available?)
- scientific article; zbMATH DE number 51770 (Why is no real title available?)
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 1215478 (Why is no real title available?)
- scientific article; zbMATH DE number 1324441 (Why is no real title available?)
- scientific article; zbMATH DE number 1140674 (Why is no real title available?)
- scientific article; zbMATH DE number 1140675 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1538017 (Why is no real title available?)
- scientific article; zbMATH DE number 1405626 (Why is no real title available?)
- A New approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method
- A Practical Decision Procedure for Arithmetic with Function Symbols
- A resolution principle for constrained logics
- Amalgamations preserving ℵ1-categoricity
- An introduction to fusion of strongly minimal sets: The geometry of fusions
- Combination of constraint solvers for free and quasi-free structures
- Combination of constraint systems II: Rational amalgamation
- Combination techniques and decision problems for disunification
- Combination techniques for non-disjoint equational theories
- Combining decision algorithms for matching in the union of disjoint equational theories
- Combining matching algorithms: The regular case
- Combining symbolic constraint solvers on algebraic domains
- Combining unification algorithms
- Combining word problems through rewriting in categories with products
- Completion of a Set of Rules Modulo a Set of Equations
- Complexity, convexity and combinations of theories
- Constraint contextual rewriting.
- Deciding Combinations of Theories
- Deciding the word problem in the union of equational theories.
- Modular properties of composable term rewriting systems
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Simplification by Cooperating Decision Procedures
- Unification in a combination of arbitrary disjoint equational theories
- Unification in the union of disjoint equational theories: Combining decision procedures
- Unions of non-disjoint theories and combinations of satisfiability procedures
Cited in
(47)- Combinations of Theories for Decidable Fragments of First-Order Logic
- On Hierarchical Reasoning in Combinations of Theories
- Frontiers of Combining Systems
- Canonization for disjoint unions of theories
- Efficient theory combination via Boolean search
- scientific article; zbMATH DE number 1950270 (Why is no real title available?)
- scientific article; zbMATH DE number 2086594 (Why is no real title available?)
- scientific article; zbMATH DE number 2090313 (Why is no real title available?)
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates
- Combining Proof-Producing Decision Procedures
- Theoretical Aspects of Computing - ICTAC 2004
- scientific article; zbMATH DE number 4049025 (Why is no real title available?)
- scientific article; zbMATH DE number 3898849 (Why is no real title available?)
- Model-theoretic methods in combined constraint satisfiability
- Tractable combinations of temporal CSPs
- Combining theories: the Ackerman and guarded fragments
- A decidability result for the model checking of infinite-state systems
- A gentle non-disjoint combination of satisfiability procedures
- A rewriting approach to the combination of data structures with bridging theories
- A polite non-disjoint combination method: theories with bridging functions revisited
- Theory combination: beyond equality sharing
- Combining nonstably infinite theories
- Conflict-driven satisfiability for theory combination: transition system and completeness
- Politeness and combination methods for theories with bridging functions
- Combination of disjoint theories: beyond decidability
- Combining non-stably infinite theories
- Deciding the word problem in the union of equational theories.
- Combining satisfiability procedures for unions of theories with a shared counting operator
- Data structures with arithmetic constraints: A non-disjoint combination
- Combining theories with shared set operations
- Decision procedures for term algebras with integer constraints
- Unions of non-disjoint theories and combinations of satisfiability procedures
- Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis
- Satisfiability modulo theories
- Tractable combinations of theories via sampling
- Unification in the union of disjoint equational theories: Combining decision procedures
- Combination of convex theories: modularity, deduction completeness, and explanation
- A New approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method
- Cover Algorithms and Their Combination
- A new combination procedure for the word problem that generalizes fusion decidability results in modal logics
- Satisfiability modulo theories and assignments
- Quantifier Elimination and Provers Integration
- Combining sets with cardinals
- Satisfiability Procedures for Combination of Theories Sharing Integer Offsets
- A comprehensive combination framework
- Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures
- Computer Science Logic
This page was built for publication: Unions of non-disjoint theories and combinations of satisfiability procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853591)
