Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative programming paradigms that have been extensively used to encode ap...
Agostino Dovier, Andrea Formisano, Enrico Pontelli
Answer-set programming (ASP) is widely recognised as a viable tool for declarative problem solving. However, there is currently a lack of tools for developing answer-set programs....
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
An often problematic feature in answer set programming is that a program does not always produce an answer set, even for programs which represent default information in a seemingl...