Constraint programming for modelling and solving modal satisfiability
From MaRDI portal
Recommendations
Cited in
(17)- Formal model-based constraint solving and document generation
- An assumption-based approach for solving the minimal S5-satisfiability problem
- Constrained pseudo-propositional logic
- scientific article; zbMATH DE number 1615250 (Why is no real title available?)
- scientific article; zbMATH DE number 1696768 (Why is no real title available?)
- A modeling layer for constraint-programming libraries
- Models and tools for improving efficiency in constraint logic programming
- Automated reasoning in modal and description logics via SAT encoding: the case study of \(K_m/\mathcal{ALC}\)-satisfiability
- Constraint solving for finite model finding in SMT solvers
- A certified constraint solver over finite domains
- Solving constraint satisfaction problems with SAT modulo theories
- Modal logic S5 satisfiability in answer set programming
- Logic programming with satisfiability
- Artificial Intelligence and Symbolic Computation
- AI*IA 2005: Advances in Artificial Intelligence
- Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ $\mathcal{ALC}$
- Recent Advances in Constraints
This page was built for publication: Constraint programming for modelling and solving modal satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897228)