140 search results - page 14 / 28 » Stable Models and Non-Determinism in Logic Programs with Neg... |
106
click to vote
EPIA
2005
Springer
15 years 5 months ago
2005
Springer
Theoretical research has spent some years facing the problem of how to represent and provide semantics to updates of logic programs. This problem is relevant for addressing highly ...
PODS
1991
ACM
15 years 3 months ago
1991
ACM
A novel approach is proposed for ezpresaing and computing eficienily a large cla88 of problem8, including jinding the shortest path in a graph, that were previously considered imp...
AAAI
2010
15 years 1 months ago
2010
In this paper, we propose a translation from normal first-order logic programs under the answer set semantics to first-order theories on finite structures. Specifically, we introd...
102
click to vote
JELIA
2000
Springer
15 years 3 months ago
2000
Springer
We present a framework for decision making with the possibility to express circumstance-dependent preferences among different alternatives for a decision. This new formalism, Order...
105
click to vote
LPNMR
2007
Springer
15 years 5 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 ...