Sciweavers

80 search results - page 11 / 16
» Semantics for Possibilistic Disjunctive Programs
Sort
View
AAAI
2008
13 years 10 months ago
A Reductive Semantics for Counting and Choice in Answer Set Programming
In a recent paper, Ferraris, Lee and Lifschitz conjectured that the concept of a stable model of a first-order formula can be used to treat some answer set programming expressions...
Joohyung Lee, Vladimir Lifschitz, Ravi Palla
AMAI
2007
Springer
13 years 8 months ago
Partial equilibrium logic
Abstract. Partial equilibrium logic (PEL) is a new nonmonotonic reasoning formalism closely aligned with logic programming under well-founded and partial stable model semantics. In...
Pedro Cabalar, Sergei P. Odintsov, David Pearce, A...
RR
2010
Springer
13 years 6 months ago
Defeasibility in Answer Set Programs via Argumentation Theories
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
Hui Wan, Michael Kifer, Benjamin N. Grosof
TCS
2010
13 years 6 months ago
Alternating states for dual nondeterminism in imperative programming
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
Wim H. Hesselink
LPNMR
2004
Springer
14 years 1 months ago
Logic Programs With Monotone Cardinality Atoms
We investigate mca-programs, that is, logic programs with clauses built of monotone cardinality atoms of the form kX , where k is a non-negative integer and X is a finite set of ...
V. Wiktor Marek, Ilkka Niemelä, Miroslaw Trus...