Dealing with Satisfiability and n-ary CSPs in a Logical Framework.
Belaid BenhamouLionel ParisPierre SiegelPublished in: J. Autom. Reason. (2012)
Keyphrases
- logical framework
- symmetry breaking
- constraint satisfaction problems
- inference rules
- belief revision
- sat problem
- reasoning tasks
- propositional logic
- satisfiability problem
- sat encodings
- np complete
- epistemic logic
- arc consistency
- constraint satisfaction
- phase transition
- constraint programming
- search space
- computational complexity
- logic programming
- linear logic