207 search results - page 11 / 42 » Debugging Logic Programs under the Answer Set Semantics |
114
Voted
LPNMR
2004
Springer
15 years 5 months ago
2004
Springer
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...
97
Voted
ECAI
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. We describe an approach for compiling dynamic preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in whi...
122
click to vote
JAPLL
2007
14 years 11 months ago
2007
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guard...
115
click to vote
ENTCS
2002
14 years 11 months ago
2002
We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a computed answer is considered wrong by the user (error symptom), ...
109
click to vote
AGP
2003
IEEE
15 years 4 months ago
2003
IEEE
Disjunctive Logic Programming (DLP) under the consistent answer set semantics is an advanced formalism for knowledge representation and reasoning. It is, under widely believed assu...