80 search results - page 5 / 16 » Semantics for Possibilistic Disjunctive Programs |
159
click to vote
KR
2004
Springer
15 years 11 months ago
2004
Springer
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
135
Voted
LPNMR
2005
Springer
15 years 11 months ago
2005
Springer
In this work we describe a system for determining strong equivalence of disjunctive non-ground datalog programs under the stable model semantics. The problem is tackled by reducing...
154
click to vote
LPNMR
2007
Springer
15 years 12 months ago
2007
Springer
Practically all programming languages used in software engineering allow to split a program into several modules. For fully declarative and nonmonotonic logic programming languages...
175
click to vote
ICLP
2003
Springer
15 years 11 months ago
2003
Springer
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...
152
Voted
CCIA
2007
Springer
15 years 12 months ago
2007
Springer
In this paper, we present an action language which is called AP oss in order to perform reasoning about actions under uncertainty. This language is based on a possibilistc logic pr...