A.C. Kakas and P. Mancarella. Negation as stable hypothesis. In Proceedings of the 1st International Workshop on Logic Programming and Non-monotonic Reasoning, pages 275--288, Washington, D.C., USA, July 1991. The MIT Press.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....an autoepistemic logic of knowledge. Lifschitz [74] presents an autoepistemic circumscriptive logic. Przymusinski [116, 118] proposes a three valued autoepistemic logic which is closely related to the well founded semantics of logic programs [148, 149] Przymusinski [117] Kakas and Mancarella [53] and Kalinski [54, 55] develop new variants of autoepistemic logic where the negative introspection rule is weaker than that in Moore s autoepistemic logic. Gelfond [31] introduces a notion of strong introspection. Besides autoepistemic logic there are many interesting alternatives to be used as ....

A.C. Kakas and P. Mancarella. Negation as stable hypothesis. In Proceedings of the 1st International Workshop on Logic Programming and Non-monotonic Reasoning, pages 275--288, Washington, D.C., USA, July 1991. The MIT Press.

....WFS is by design overly careful in deciding about the falsity of some atoms, leaving them undefined, and that a suitable form of CWA can be used to safely and undisputably assume false some of the atoms absent from the well founded model of a program. Consider the following example adapted from [3], itself a variant of the game example of [2] Example 1 Consider the program: win(X) move(X; Y ) win(Y ) raisedBet(X) win(X) move(a; a) move(b; c) expressing that X is a winning position if there is a move from X to Y and Y is not a winning position , in a winning position ....

A. C. Kakas and P. Mancarella. Negation as stable hypothesis. In A. Nerode, W. Marek, and V. S. Subrahmanian, editors, Logic Programming and NonMonotonic Reasoning, pages 275--288. MIT Press, 1991.

....of sustainable A Models that provide a better understanding of them, and also give hints for their construction without having to previously calculate all AModels. We begin with properties that show how our models can be viewed as an extension to Well Founded Semantics (WFS) As mentioned in [ Kakas and Mancarella, 1991a ] negation in WFS is based on the notion of support, i.e. a literal L only belongs to an Extended Stable Model (XSM) if all the rules for L (if any) have false bodies in the XSM. In contradistinction, we are interested in negations as consistent hypotheses that cannot be defeated. To that end ....

A. C. Kakas and P. Mancarella. Negation as stable hypothesis. In A. Nerode, W. Marek, and V. S. Subrahmanian, editors, Logic Programming and NonMonotonic Reasoning '91. MIT Press, 1991.

....an autoepistemic logic of knowledge. Lifschitz [74] presents an autoepistemic circumscriptive logic. Przymusinski [116, 118] proposes a three valued autoepistemic logic which is closely related to the well founded semantics of logic programs [148, 149] Przymusinski [117] Kakas and Mancarella [53] and Kalinski [54, 55] develop new variants of autoepistemic logic where the negative introspection rule is weaker than that in Moore s autoepistemic logic. Gelfond [31] introduces a notion of strong introspection. Besides autoepistemic logic there are many interesting alternatives to be used as a ....

A.C. Kakas and P. Mancarella. Negation as stable hypothesis. In Proceedings of the 1st International Workshop on Logic Programming and Non-monotonic Reasoning, pages 275--288, Washington, D.C., USA, July 1991. The MIT Press.

.... connections have been pointed out by Bylander in [21] and by Friedrich, Gottlob and Nejdl in [53] In this paper we focus on logic based abduction, since it has been shown to be tightly related to negation in logic programming (see for example Eshghi and Kowalski [49] and Kakas and Mancarella [75]) and default logic (see [144] Furthermore, we only consider propositional languages, since very little is known about first order abduction. Logic based abduction has been defined as follows in [144] Given a set of propositional clauses Sigma and a letter q, an explanation for q is a set of ....

A. C. Kakas and P. Mancarella. Negation as stable hypothesis. In Proceedings of the First International Workshop on Logic Programming and Non Monotonic Reasoning, pages 275--288. The MIT press, 1991.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC