Pages that link to "Item:Q1853591"

The following pages link to Unions of non-disjoint theories and combinations of satisfiability procedures (Q1853591):

Displaying 18 items.

• A decidability result for the model checking of infinite-state systems (Q438572) (← links)
• Model-theoretic methods in combined constraint satisfiability (Q556677) (← links)
• Combining sets with cardinals (Q812443) (← links)
• Combining nonstably infinite theories (Q851136) (← links)
• Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis (Q1037399) (← links)
• Combination of convex theories: modularity, deduction completeness, and explanation (Q1041593) (← links)
• Deciding the word problem in the union of equational theories. (Q1400706) (← links)
• Unions of non-disjoint theories and combinations of satisfiability procedures (Q1853591) (← links)
• Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
• Tractable combinations of theories via sampling (Q2055788) (← links)
• Politeness and combination methods for theories with bridging functions (Q2303236) (← links)
• A new combination procedure for the word problem that generalizes fusion decidability results in modal logics (Q2432763) (← links)
• Efficient theory combination via Boolean search (Q2432765) (← links)
• Decision procedures for term algebras with integer constraints (Q2432767) (← links)
• Canonization for disjoint unions of theories (Q2486580) (← links)
• A Rewriting Approach to the Combination of Data Structures with Bridging Theories (Q2964468) (← links)
• Combining Theories: The Ackerman and Guarded Fragments (Q3172881) (← links)
• Satisfiability Modulo Theories (Q3176369) (← links)