Pages that link to "Item:Q3608775"
From MaRDI portal
The following pages link to Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic (Q3608775):
Displaying 22 items.
- Cardinality constraints for arrays (decidability results and applications) (Q1688541) (← links)
- One-variable logic meets Presburger arithmetic (Q2007734) (← links)
- NP satisfiability for arrays as powers (Q2152659) (← links)
- (Q2767086) (← links)
- Counting Constraints in Flat Array Fragments (Q2817911) (← links)
- A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT (Q2817912) (← links)
- Colors Make Theories Hard (Q2817916) (← links)
- Decision Procedures for Region Logic (Q2891431) (← links)
- Sets with Cardinality Constraints in Satisfiability Modulo Theories (Q3075499) (← links)
- Linear Arithmetic with Stars (Q3512499) (← links)
- Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars (Q3540175) (← links)
- Combining Theories with Shared Set Operations (Q3655212) (← links)
- (Q4553283) (← links)
- The Support of Integer Optimal Solutions (Q4577743) (← links)
- (Q4804883) (← links)
- (Q4809068) (← links)
- Certified Reasoning with Infinity (Q5206958) (← links)
- Decision Procedures for Multisets with Cardinality Constraints (Q5452719) (← links)
- On algebraic array theories (Q6192058) (← links)
- How to tell easy from hard: complexities of conjunctive query entailment in extensions of \(\mathcal{ALC}\) (Q6535408) (← links)
- Succinct ordering and aggregation constraints in algebraic array theories (Q6561348) (← links)
- Two variable logic with ultimately periodic counting (Q6573777) (← links)