Sciweavers

69 search results - page 3 / 14
» Normal Form Results for Default Logic
Sort
View
ICLP
2009
Springer
14 years 6 months ago
Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
Miroslaw Truszczynski
ICDT
1990
ACM
110views Database» more  ICDT 1990»
13 years 10 months ago
Beginnings of a Theory of General Database Completions
Ordinary logical implication is not enough for answering queries in a logic database, since especially negative information is only implicitly represented in the database state. M...
Stefan Brass
NMR
2004
Springer
13 years 11 months ago
A probabilistic approach to default reasoning
A logic is defined which in addition to propositional calculus contains several types of probabilistic operators which are applied only to propositional formulas. For every s ∈...
Miodrag Raskovic, Zoran Ognjanovic, Zoran Markovic
IBERAMIA
2004
Springer
13 years 11 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, ...
ECAI
1992
Springer
13 years 10 months ago
On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
Ilkka Niemelä, Jussi Rintanen