Pages that link to "Item:Q3899468"
From MaRDI portal
The following pages link to Simplification by Cooperating Decision Procedures (Q3899468):
Displayed 50 items.
- Model-theoretic methods in combined constraint satisfiability (Q556677) (← links)
- A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case (Q556680) (← links)
- Unification in a combination of arbitrary disjoint equational theories (Q582270) (← links)
- Combination techniques and decision problems for disunification (Q673624) (← links)
- Essence of generalized partial computation (Q808278) (← links)
- Combining sets with cardinals (Q812443) (← links)
- Combining nonstably infinite theories (Q851136) (← links)
- Deciding Boolean algebra with Presburger arithmetic (Q861705) (← links)
- An institution-independent proof of the Robinson consistency theorem (Q878156) (← links)
- Modular term rewriting systems and the termination (Q910207) (← links)
- Common knowledge does not have the Beth property (Q987837) (← links)
- A semantic approach to interpolation (Q1006639) (← links)
- Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis (Q1037399) (← links)
- Efficient Craig interpolation for linear Diophantine (dis)equations and linear modular equations (Q1039847) (← links)
- Theory decision by decomposition (Q1041591) (← links)
- Combination of convex theories: modularity, deduction completeness, and explanation (Q1041593) (← links)
- A decision procedure for combinations of propositional temporal logic and other specialized theories (Q1097264) (← links)
- A structure-preserving clause form translation (Q1098330) (← links)
- Unification in combinations of collapse-free regular theories (Q1099652) (← links)
- Combination of constraint solvers for free and quasi-free structures (Q1127338) (← links)
- Complexity, convexity and combinations of theories (Q1141138) (← links)
- Natural language syntax and first-order inference (Q1193491) (← links)
- An overview of the Tecton proof system (Q1341710) (← links)
- Embedding complex decision procedures inside an interactive theorem prover. (Q1353946) (← links)
- Deciding the word problem in the union of equational theories. (Q1400706) (← links)
- A rewriting approach to satisfiability procedures. (Q1401930) (← links)
- Virtual worlds as meeting places for formal systems (Q1402195) (← links)
- Constraint contextual rewriting. (Q1404984) (← links)
- Towards an integration science. The influence of Richard Bellman on our research. (Q1584626) (← links)
- Editors' introduction to the special issue on combining logics (Q1815423) (← links)
- Unions of non-disjoint theories and combinations of satisfiability procedures (Q1853591) (← links)
- Structured proof procedures (Q1924823) (← links)
- Strategies for combining decision procedures (Q2368951) (← links)
- A new combination procedure for the word problem that generalizes fusion decidability results in modal logics (Q2432763) (← links)
- Modular proof systems for partial functions with Evans equality (Q2432764) (← links)
- Efficient theory combination via Boolean search (Q2432765) (← links)
- Decision procedures for term algebras with integer constraints (Q2432767) (← links)
- Partition-based logical reasoning for first-order and propositional theories (Q2457688) (← links)
- Decision procedures for extensions of the theory of arrays (Q2457800) (← links)
- Canonization for disjoint unions of theories (Q2486580) (← links)
- A randomized satisfiability procedure for arithmetic and uninterpreted function symbols (Q2486581) (← links)
- An interpolating theorem prover (Q2575736) (← links)
- On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP (Q3183129) (← links)
- Verifying Heap-Manipulating Programs in an SMT Framework (Q3510799) (← links)
- Ground Interpolation for the Theory of Equality (Q3617772) (← links)
- Satisfiability Procedures for Combination of Theories Sharing Integer Offsets (Q3617773) (← links)
- Efficient Term-ITE Conversion for Satisfiability Modulo Theories (Q3637169) (← links)
- Combining Equational Reasoning (Q3655192) (← links)
- Combinations of Theories for Decidable Fragments of First-Order Logic (Q3655205) (← links)
- Data Structures with Arithmetic Constraints: A Non-disjoint Combination (Q3655209) (← links)