41 search results - page 2 / 9 » The Extended Stable Models of Contradiction Removal Semantic... |
ICLP
2003
Springer
13 years 11 months ago
2003
Springer
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...
DEDUCTIVE
1996
13 years 7 months ago
1996
We de ne a preferential semantics based on stable generated models for a very general class of temporal deductive databases. We allow two kinds of temporal information to be repre...
IBERAMIA
2004
Springer
13 years 11 months ago
2004
Springer
Over the last years various semantics have been proposed for dealing with updates of logic programs by (other) logic programs. Most of these semantics extend the stable models sema...
AMAI
1999
Springer
13 years 5 months ago
1999
Springer
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
LPNMR
2007
Springer
13 years 12 months ago
2007
Springer
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...