Quantified constraint handling rules
From MaRDI portal
Cites work
- A First Order Forward Chaining Approach for Answer Set Computing
- An efficient solver for ASP(Q)
- Beyond NP: quantifying over answer sets
- BlockSolve: A Bottom-Up Approach for Solving Quantified CSPs
- Constraint Handling Rules
- Constraint handling rules and tabled execution
- Essentials of constraint programming
- Linear logic
- Linear-logic based analysis of Constraint Handling Rules with disjunction
- Planning with Incomplete Information in Quantified Answer Set Programming
- Principles and Practice of Constraint Programming – CP 2004
- QUBE: A system for deciding quantified Boolean formulas satisfiability
- QUBOS: Deciding quantified Boolean logic using propositional satisfiability solvers
- Resolution for quantified Boolean formulas
- Resolve and expand
- Solving problems in the polynomial hierarchy with ASP(Q)
- Solving quantified constraint satisfaction problems
- The refined operational semantics of constraint handling rules
- Theory and practice of constraint handling rules
- Value ordering for quantified CSPs
- {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
This page was built for publication: Quantified constraint handling rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6939165)