Sciweavers

213 search results - page 16 / 43
» Logic programs with annotated disjunctions
Sort
View
LOPSTR
2007
Springer
14 years 2 months ago
Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs
Amadeo Casas, Manuel Carro, Manuel V. Hermenegildo
ICLP
2009
Springer
14 years 8 months ago
Modular Nonmonotonic Logic Programming Revisited
Recently, enabling modularity aspects in Answer Set Programming (ASP) has gained increasing interest to ease the composition of program parts to an overall program. In this paper, ...
Minh Dao-Tran, Thomas Eiter, Michael Fink, Thomas ...
ICLP
2003
Springer
14 years 1 months ago
Uniform Equivalence of Logic Programs under the Stable Model Semantics
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
Thomas Eiter, Michael Fink
ICLP
1994
Springer
14 years 3 days ago
Splitting a Logic Program
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
Vladimir Lifschitz, Hudson Turner
MICAI
2000
Springer
13 years 11 months ago
Knowledge Representation Using High-Level Non-monotonic Reasoning
We introduce the new paradigm of High-Level Non-Monotonic reasoning (HLNM). This paradigm is the consolidation of our recent results on disjunctions, sets, explicit and implicit ne...
Mauricio Osorio, Juan Carlos Nieves, Fernando Zaca...