140 search results - page 11 / 28 » Stable Models and Non-Determinism in Logic Programs with Neg... |
EPIA
1995
Springer
15 years 3 months ago
1995
Springer
We provide a nine-valued logic to characterize the models of logic programs under a paraconsistent well-founded semantics with explicit negation WFSX p. We define a truth-function...
130
click to vote
JELIA
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. Among others, Alferes et al. (1998) presented an approach for updating logic programs with sets of rules based on dynamic logic programs. We syntactically redefine dynami...
LPNMR
2001
Springer
15 years 4 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...
FAC
2008
14 years 11 months ago
2008
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...
COMMA
2006
15 years 1 months ago
2006
In this paper, we examine an argument-based semantics called semi-stable semantics. Semi-stable semantics is quite close to traditional stable semantics in the sense that every st...