Pages that link to "Item:Q861705"

The following pages link to Deciding Boolean algebra with Presburger arithmetic (Q861705):

Displaying 18 items.

• Logic-based ontology comparison and module extraction, with an application to DL-Lite (Q622105) (← links)
• Cardinality constraints for arrays (decidability results and applications) (Q1688541) (← links)
• Checking deadlock-freedom of parametric component-based systems (Q1996857) (← links)
• Higher-order quantifier elimination, counter simulations and fault-tolerant systems (Q2031422) (← links)
• Efficient automated reasoning about sets and multisets with cardinality constraints (Q2096432) (← links)
• NP satisfiability for arrays as powers (Q2152659) (← links)
• Counting Constraints in Flat Array Fragments (Q2817911) (← links)
• A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT (Q2817912) (← links)
• Sets with Cardinality Constraints in Satisfiability Modulo Theories (Q3075499) (← links)
• Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars (Q3540175) (← links)
• Effective Quantifier Elimination for Presburger Arithmetic with Infinity (Q3644100) (← links)
• Combining Theories with Shared Set Operations (Q3655212) (← links)
• (Q4553283) (← links)
• Using First-Order Theorem Provers in the Jahob Data Structure Verification System (Q5452598) (← links)
• Decision Procedures for Multisets with Cardinality Constraints (Q5452719) (← links)
• MUNCH - Automated Reasoner for Sets and Multisets (Q5747757) (← links)
• On algebraic array theories (Q6192058) (← links)
• Succinct ordering and aggregation constraints in algebraic array theories (Q6561348) (← links)