308 search results - page 4 / 62 » Answer Set Programming Based on Propositional Satisfiability |
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...
94
Voted
IJCAI
2007
14 years 11 months ago
2007
We first provide a mapping from Pearce’s equilibrium logic and Ferraris’s general logic programs to Lin and Shoham’s logic of knowledge and justified assumptions, a nonmon...
76
Voted
LPNMR
2009
Springer
15 years 4 months ago
2009
Springer
ICLP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...
182
Voted
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...