aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming
- 15 September 2015
- book chapter
- Published by Springer Nature
- p. 112-126
Abstract
No abstract availableKeywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Compiling Pseudo-Boolean Constraints to SAT with Order Encoding2013
- ASP modulo CSP: The clingcon systemTheory and Practice of Logic Programming, 2012
- A Constraint Seeker: Finding and Ranking Global Constraints from Examples2011
- A translational approach to constraint answer set solvingTheory and Practice of Logic Programming, 2010
- A SAT-based Method for Solving the Two-dimensional Strip Packing ProblemFundamenta Informaticae, 2010
- Constraint Answer Set SolvingLecture Notes in Computer Science, 2009
- Compiling finite linear CSP into SATConstraints, 2008
- Knowledge Representation, Reasoning and Declarative Problem Solving2003
- SAT v CSP2000
- On the parallel complexity of discrete relaxation in constraint satisfaction networksArtificial Intelligence, 1990