308 search results - page 24 / 62 » Answer Set Programming Based on Propositional Satisfiability |
ICLP
2004
Springer
14 years 1 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
LPNMR
2009
Springer
14 years 2 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
VL
2008
IEEE
14 years 2 months ago
2008
IEEE
Previous research has identified several challenges that programmers face in answering questions about a code base. To explore ways to overcome those challenges, we have develope...
LPNMR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The recently proposed notion of an elementary set yielded a refinement of the theorem on loop formulas, telling us that the stable models of a disjunctive logic program ...
BIRTHDAY
2000
Springer
14 years 13 hour ago
2000
Springer
A number of prioritized variants of Reiter’s default logic have been described in the literature. In this paper, we introduce two natural principles for preference handling and s...