248 search results - page 2 / 50 » On the existence of stable models of non-stratified logic pr... |
ICLP
2001
Springer
13 years 10 months ago
2001
Springer
In the paper we establish the xed-parameter complexity for several parameterized decision problems involving models, supported models and stable models of logic programs. We also e...
LPNMR
2004
Springer
13 years 11 months ago
2004
Springer
Over recent years, various semantics have been proposed for dealing with updates in the setting of logic programs. The availability of different semantics naturally raises the que...
COMMA
2006
13 years 7 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...
ILP
2001
Springer
13 years 10 months ago
2001
Springer
In the line of previous work by S. Muggleton and C. Sakama, we extend the logical characterization of inductive logic programming, to normal logic programs under the stable models ...
KR
2004
Springer
13 years 11 months ago
2004
Springer
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...