Constraint CNF: SAT and CSP Language Under One Roof.

DOI10.4230/OASIcs.ICLP.2016.12zbMath1428.68284OpenAlexW2236450292MaRDI QIDQ5240215

Yuliya Lierler, Broes de Cat

Publication date: 24 October 2019

Full work available at URL: https://dblp.uni-trier.de/db/conf/iclp/iclp2016.html#CatL16

zbMATH Keywords

constraint programmingpropositional satisfiability

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Classical propositional logic (03B05)

Related Items

Pruning external minimality checking for answer set programs using semantic dependencies

Uses Software

• MiniSat
• Sugar
• Clingcon

Cites Work

• Unnamed Item
• Unnamed Item
• Compiling finite linear CSP into SAT
• Conflict-driven answer set solving: from theory to practice
• Propagation via lazy clause generation
• Abstract answer set solvers with backjumping and learning
• Solving SAT and SAT Modulo Theories
• Constraint Answer Set Solving
• Abstract Answer Set Solvers
• Theory and Applications of Satisfiability Testing

This page was built for publication: Constraint CNF: SAT and CSP Language Under One Roof.