248 search results - page 9 / 50 » On the existence of stable models of non-stratified logic pr... |
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...
IBERAMIA
2004
Springer
15 years 5 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...
98
Voted
IANDC
2006
14 years 11 months ago
2006
It is well-known that stable models (as dI-domains, qualitative domains and coherence are not fully abstract for the language PCF. This fact is related to the existence of stable ...
80
Voted
ASP
2001
Springer
15 years 4 months ago
2001
Springer
In this paper we present a framework for logic programming agents to take part in games in such a way that stable models of the system, the ones agreed upon by all the members, co...