Sciweavers

80 search results - page 5 / 16
» Semantics for Possibilistic Disjunctive Programs
Sort
View
KR
2004
Springer
14 years 1 months ago
On Eliminating Disjunctions in Stable Logic Programming
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...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
LPNMR
2005
Springer
14 years 1 months ago
Testing Strong Equivalence of Datalog Programs - Implementation and Examples
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...
Thomas Eiter, Wolfgang Faber, Patrick Traxler
LPNMR
2007
Springer
14 years 2 months ago
Modularity Aspects of Disjunctive Stable Models
Practically all programming languages used in software engineering allow to split a program into several modules. For fully declarative and nonmonotonic logic programming languages...
Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Ste...
ICLP
2003
Springer
14 years 1 months ago
Order and Negation as Failure
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...
Davy Van Nieuwenborgh, Dirk Vermeir
CCIA
2007
Springer
14 years 2 months ago
Reasoning about actions under uncertainty: A possibilistic approach
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...
Juan Carlos Nieves, Mauricio Osorio, Ulises Cort&e...