Browsing by Subject "Stable model semantics"
Now showing items 1-3 of 3
-
Article
The computational value of joint consistency
(1994)In this paper we investigate the complexity of some recent reconstructions of Reiter's Default Logic using graph-theoretical structures. It turns out that requiring joint consistency of the justification of the applied ...
-
Article
On the semantics of abstract argumentation
(2013)Arguments need to be judged against other arguments. The decision to accept or reject an argument is generally a global decision that involves examining the same question for other arguments that oppose or can defend the ...
-
Article
Towards local search for answer sets
(2002)Answer set programming has emerged as a new important paradigm for declarative problem solving. It relies on algorithms that compute the stable models of a logic program, a problem that is, in the worst-case, intractable. ...