Sciweavers

764 search results - page 10 / 153
» On the Expressibility of Stable Logic Programming
Sort
View
ICLP
2001
Springer
14 years 14 days ago
Fixed-Parameter Complexity of Semantics for Logic Programs
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...
Zbigniew Lonc, Miroslaw Truszczynski
JELIA
2000
Springer
13 years 11 months ago
Considerations on Updates of Logic Programs
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...
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Ha...
IBERAMIA
2004
Springer
14 years 1 months ago
Well Founded Semantics for Logic Program Updates
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...
Federico Banti, José Júlio Alferes, ...
AAAI
1998
13 years 9 months ago
Fixpoint 3-Valued Semantics for Autoepistemic Logic
The paper presents a constructive 3-valued semantics for autoepistemic logic (AEL). We introduce a derivation operator and de ne the semantics as its least xpoint. The semantics is...
Marc Denecker, V. Wiktor Marek, Miroslaw Truszczyn...
KR
2004
Springer
14 years 1 months ago
A Causal Logic of Logic Programming
The causal logic from (Bochman 2003b) is shown to provide a natural logical basis for logic programming. More exactly, it is argued that any logic program can be seen as a causal ...
Alexander Bochman