Sciweavers

140 search results - page 1 / 28
» Stable Models and Non-Determinism in Logic Programs with Neg...
Sort
View
PODS
1990
ACM
148views Database» more  PODS 1990»
13 years 8 months ago
Stable Models and Non-Determinism in Logic Programs with Negation
Previous researchers have proposed generalizations of Horn clause logic to support negation and nondeterminism as two separate extensions. In this paper, we show that the stable m...
Domenico Saccà, Carlo Zaniolo
DOOD
1991
Springer
107views Database» more  DOOD 1991»
13 years 8 months ago
Non-Determinism in Deductive Databases
This paper examines the problem of adding non-deterministic constructs to a declarative database language based on Horn Clause Logic. We revise a previously proposed approach, the...
Fosca Giannotti, Dino Pedreschi, Domenico Sacc&agr...
JLP
2000
134views more  JLP 2000»
13 years 4 months ago
Abducing through negation as failure: stable models within the independent choice logic
The independent choice logic (ICL) is part of a project to combine logic and decision/game theory into a coherent framework. The ICL has a simple possible-worlds semantics charact...
David Poole
AAAI
1990
13 years 5 months ago
Computing Stable Models by Using the ATMS
An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stabl...
Kave Eshghi
LFCS
2007
Springer
13 years 10 months ago
Compactness Properties for Stable Semantics of Logic Programs
Logic programming with stable logic semantics (SLP) is a logical formalism that assigns to sets of clauses in the language admitting negations in the bodies a special kind of mode...
Victor W. Marek, Jeffrey B. Remmel