908 search results - page 2 / 182 » Generating maximal models using the stable model semantics |
118
Voted
DEDUCTIVE
1996
15 years 2 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...
125
Voted
LANMR
2007
15 years 2 months ago
2007
Abstract We study the notion of strong equivalence between two disjunctive logic programs under the G3-stable model semantics, also called the P-stable semantics, and we show how s...
134
Voted
ASP
2005
Springer
15 years 6 months ago
2005
Springer
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
149
Voted
ICLP
2003
Springer
15 years 6 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...
109
click to vote
LPNMR
2001
Springer
15 years 5 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...