194 search results - page 8 / 39 » Tabular Constraint-Satisfaction Problems and Answer Set Prog... |
99
Voted
LPNMR
2007
Springer
15 years 3 months ago
2007
Springer
We describe BE, an implemented system for solving belief change problems in the presence of actions. We illustrate how we can use BE to compute the result of belief progression, be...
109
click to vote
CORR
2002
Springer
14 years 9 months ago
2002
Springer
A relational database is inconsistent if it does not satisfy a given set of integrity constraints. Nevertheless, it is likely that most of the data in it is consistent with the co...
AAAI
2008
14 years 12 months ago
2008
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....
85
Voted
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
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...
102
click to vote
AGP
2003
IEEE
15 years 2 months ago
2003
IEEE
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” nature ...