Pages that link to "Item:Q1141138"

The following pages link to Complexity, convexity and combinations of theories (Q1141138):

Displaying 35 items.

• A tool for deciding the satisfiability of continuous-time metric temporal logic (Q262137) (← links)
• Combining decision procedures by (model-)equality propagation (Q436376) (← links)
• Model-theoretic methods in combined constraint satisfiability (Q556677) (← links)
• Many-sorted equivalence of shiny and strongly polite theories (Q682380) (← links)
• Combining sets with cardinals (Q812443) (← links)
• Combining nonstably infinite theories (Q851136) (← links)
• An institution-independent proof of the Robinson consistency theorem (Q878156) (← links)
• A semantic approach to interpolation (Q1006639) (← links)
• Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis (Q1037399) (← links)
• Combination of constraint solvers for free and quasi-free structures (Q1127338) (← links)
• Unions of non-disjoint theories and combinations of satisfiability procedures (Q1853591) (← links)
• Dynamic causes for the violation of timed reachability properties (Q1996021) (← links)
• Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
• Tractable combinations of theories via sampling (Q2055788) (← links)
• Generalised graded interpolation (Q2105608) (← links)
• Symbolic computation in Maude: some tapas (Q2119100) (← links)
• Metalevel algorithms for variant satisfiability (Q2413027) (← links)
• Efficient theory combination via Boolean search (Q2432765) (← links)
• Being careful about theory combination (Q2441773) (← links)
• Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages (Q2697538) (← links)
• Order-Sorted Rewriting and Congruence Closure (Q2811360) (← links)
• Colors Make Theories Hard (Q2817916) (← links)
• Metalevel Algorithms for Variant Satisfiability (Q2827841) (← links)
• Model-based theory combination (Q2864402) (← links)
• Horn Clause Solvers for Program Verification (Q2947164) (← links)
• Sharing Is Caring: Combination of Theories (Q3172894) (← links)
• Satisfiability Modulo Theories (Q3176369) (← links)
• Interpolation for predefined types (Q3225735) (← links)
• Combining Equational Reasoning (Q3655192) (← links)
• Variant-Based Satisfiability in Initial Algebras (Q4686604) (← links)
• Quantifier Elimination and Provers Integration (Q4916219) (← links)
• Combining Non-Stably Infinite Theories (Q4916220) (← links)
• (Q5094139) (← links)
• A New approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method (Q5234683) (← links)
• Variants and satisfiability in the infinitary unification wonderland (Q6113018) (← links)