Sciweavers

4401 search results - page 21 / 881
» Computing with Default Logic
Sort
View
AMAI
2006
Springer
13 years 8 months ago
Strong and uniform equivalence of nonmonotonic theories - an algebraic approach
We show that the concepts of strong and uniform equivalence of logic programs eneralized to an abstract algebraic setting of operators on complete lattices. Our results imply char...
Miroslaw Truszczynski
LPNMR
2001
Springer
14 years 1 months ago
plp: A Generic Compiler for Ordered Logic Programs
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
James P. Delgrande, Torsten Schaub, Hans Tompits
NMR
2004
Springer
14 years 2 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
POPL
1995
ACM
14 years 5 days ago
Default Timed Concurrent Constraint Programming
d Abstract) We extend the model of [VRV94] to express strong time-outs (and pre-emption): if an event A does not happen through time t, cause event B to happen at time t. Such con...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta
SIGLEX
1991
14 years 4 days ago
Presuppositions and Default Reasoning: A Study in Lexical Pragmatics
Explaining how the meaning of words relate to the meaning of the utterance in which they are used is of utmost importance. The most common approaches view the meaning of an uttera...
Robert E. Mercer