97 search results - page 5 / 20 » Computing Stable and Partial Stable Models of Extended Disju... |
LPNMR
2007
Springer
14 years 2 months ago
2007
Springer
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
AMAI
2008
Springer
13 years 8 months ago
2008
Springer
The paper studies the relationship between logic programs with the stable model semantics and difference logic recently considered in the Satisfiability Modulo Theories framework....
PODS
1990
ACM
14 years 18 days ago
1990
ACM
Previous researchers have proposed generalizations of Horn clause logic to support negation and nondeterminism as two separate extensions. In this paper, we show that the stable m...
SUM
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We present the Consistency Extractor System (ConsEx) that uses answer set programming to compute consistent answers to first-order queries posed to relational databases ...
LPNMR
2007
Springer
14 years 2 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 ...