Pages that link to "Item:Q5256336"
From MaRDI portal
The following pages link to Modal Satisfiability via SMT Solving (Q5256336):
Displaying 15 items.
- Solving constraint satisfaction problems with SAT modulo theories (Q487632) (← links)
- Solving the \$100 modal logic challenge (Q1006738) (← links)
- Decidability by resolution for propositional modal logics (Q1284704) (← links)
- SAT-based decision procedures for classical modal logics (Q1610667) (← links)
- Using resolution for testing modal satisfiability and building models (Q1610669) (← links)
- An assumption-based approach for solving the minimal S5-satisfiability problem (Q1799062) (← links)
- Building decision procedures for modal logics from propositional decision procedures: The case study of modal \(K(m)\). (Q1854375) (← links)
- SAT-based decision procedures for classical modal logics (Q2751042) (← links)
- Constraint solving for finite model finding in SMT solvers (Q4593094) (← links)
- CoLoSS: The Coalgebraic Logic Satisfiability Solver (Q4982113) (← links)
- Generalized Modal Satisfiability (Q5449825) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897228) (← links)
- Recent Advances in Constraints (Q5901713) (← links)
- Deciding Extended Modal Logics by Combining State Space Generation and SAT Solving (Q6108819) (← links)
- Non-classical logics in satisfiability modulo theories (Q6541143) (← links)