Phan Minh Dung. Negation as hypothesis: an abductive foundation for logic programming. In K. Furukawa, editor, Proceedings of the 8th International Conference on Logic Programming, pages 3-17, Paris, France, 1991. MIT Press. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On the Computational Complexity of Assumption-Based.. - Dimopoulos, Nebel, Toni (2002) (Correct)
....not in the set. In abstract terms, an assumption can be attacked if its contrary can be proved, in the underlying monotonic logic, possibly with the aid of other conflicting assumptions. Bondarenko et al. also propose two new semantics generalising, respectively, the admissibility semantics [8] and the semantics of preferred extensions [8] or partial stable models [27] for LP. In abstract terms, a set of assumptions is an admissible argument of a given theory, formulated in an underlying monotonic logic, iff it does not attack itself and it attacks all sets of assumptions which attack ....
....can be attacked if its contrary can be proved, in the underlying monotonic logic, possibly with the aid of other conflicting assumptions. Bondarenko et al. also propose two new semantics generalising, respectively, the admissibility semantics [8] and the semantics of preferred extensions [8] or partial stable models [27] for LP. In abstract terms, a set of assumptions is an admissible argument of a given theory, formulated in an underlying monotonic logic, iff it does not attack itself and it attacks all sets of assumptions which attack it. A set of assumptions is a preferred ....
[Article contains additional citation context not shown here]
Phan Minh Dung. Negation as hypothesis: an abductive foundation for logic programming. In K. Furukawa, editor, Proceedings of the 8th International Conference on Logic Programming, pages 3--17, Paris, France, 1991. MIT Press.
Finding Admissible and Preferred Arguments Can be Very Hard - Dimopoulos, al. (5 citations) (Correct)
.... many existing logics for nonmonotonic reasoning, in particular Theorist [Poole, 1988] Circumscription [McCarthy, 1980] and Autoepistemic Logic (AEL) Moore, 1985] They also propose two new (argumentation theoretic)semantics for nonmonotonic reasoning, generalising the admissibility semantics [Dung, 1991] and the semantics of preferred extensions [Dung, 1991] or partial stable models [Sacc a and Zaniolo, 1990] for logic programming. In this paper we refer to the new semantics as admissible and preferred arguments, respectively. The new semantics are more general than the standard semantics of ....
.... Theorist [Poole, 1988] Circumscription [McCarthy, 1980] and Autoepistemic Logic (AEL) Moore, 1985] They also propose two new (argumentation theoretic)semantics for nonmonotonic reasoning, generalising the admissibility semantics [Dung, 1991] and the semantics of preferred extensions [Dung, 1991] or partial stable models [Sacc a and Zaniolo, 1990] for logic programming. In this paper we refer to the new semantics as admissible and preferred arguments, respectively. The new semantics are more general than the standard semantics of stable extensions for nonmonotonic reasoning, since every ....
[Article contains additional citation context not shown here]
Phan Minh Dung. Negation as hypothesis: an abductive foundation for logic programming. In K. Furukawa, editor, Proceedings of the 8th International Conference on Logic programming, pages 3--17, Paris, France, 1991. MIT Press. 8
Finding Admissible and Preferred Arguments Can be Very Hard - Dimopoulos, al. (2000) (5 citations) (Correct)
.... many existing logics for nonmonotonic reasoning, in particular Theorist [Poole, 1988] Circumscription [McCarthy, 1980] and Autoepistemic Logic (AEL) Moore, 1985] They also propose two new (argumentation theoretic)semantics for nonmonotonic reasoning, generalising the admissibility semantics [Dung, 1991] and the semantics of preferred extensions [Dung, 1991] or partial stable models [Sacca and Zaniolo, 1990] for logic programming. In this paper we refer to the new semantics as admissible and preferred arguments, respectively. The new semantics are more general than the standard semantics of ....
.... Theorist [Poole, 1988] Circumscription [McCarthy, 1980] and Autoepistemic Logic (AEL) Moore, 1985] They also propose two new (argumentation theoretic)semantics for nonmonotonic reasoning, generalising the admissibility semantics [Dung, 1991] and the semantics of preferred extensions [Dung, 1991] or partial stable models [Sacca and Zaniolo, 1990] for logic programming. In this paper we refer to the new semantics as admissible and preferred arguments, respectively. The new semantics are more general than the standard semantics of stable extensions for nonmonotonic reasoning, since every ....
[Article contains additional citation context not shown here]
Phan Minh Dung. Negation as hypothesis: an abductive foundation for logic programming. In K. Furukawa, editor, Proceedings of the 8th International Conference on Logic programming, pages 3--17, Paris, France, 1991. MIT Press. 8
Preferred Arguments are Harder to Compute than Stable.. - Dimopoulos, Nebel, Toni (1999) (10 citations) (Correct)
....In abstract terms, an assumption is attacked if its contrary can be proven, in some appropriate underlying monotonic logic, possibly with the aid of other con icting assumptions. Bondarenko et al. 1997 ] also propose two new semantics generalising, respectively, the admissibility semantics [ Dung, 1991 ] and the semantics of preferred extensions [ Dung, 1991 ] and partial stable models [ Sacc a and Zaniolo, 1990 ] for LP. In abstract terms, a set of assumptions is an admissible argument of a given theory, i it does not attack itself and it attacks all sets of assumptions which attack it. A set ....
....can be proven, in some appropriate underlying monotonic logic, possibly with the aid of other con icting assumptions. Bondarenko et al. 1997 ] also propose two new semantics generalising, respectively, the admissibility semantics [ Dung, 1991 ] and the semantics of preferred extensions [ Dung, 1991 ] and partial stable models [ Sacc a and Zaniolo, 1990 ] for LP. In abstract terms, a set of assumptions is an admissible argument of a given theory, i it does not attack itself and it attacks all sets of assumptions which attack it. A set of assumptions is a preferred argument i it is a ....
[Article contains additional citation context not shown here]
Phan Minh Dung. Negation as hypothesis: an abductive foundation for logic programming. In K. Furukawa, editor, Proceedings of the 8th International Conference on Logic programming, pages 3-17, Paris, France, 1991. MIT Press.
Preferred Arguments are Harder to Compute than Stable.. - Dimopoulos, Nebel, Toni (1999) (10 citations) (Correct)
....In abstract terms, an assumption is attacked if its contrary can be proven, in some appropriate underlying monotonic logic, possibly with the aid of other conflicting assumptions. Bondarenko et al. 1997 ] also propose two new semantics generalising, respectively, the admissibility semantics [ Dung, 1991 ] and the semantics of preferred extensions [ Dung, 1991 ] and partial stable models [ Sacc a and Zaniolo, 1990 ] for LP. In abstract terms, a set of assumptions is an admissible argument of a given theory, iff it does not attack itself and it attacks all sets of assumptions which attack it. A ....
....can be proven, in some appropriate underlying monotonic logic, possibly with the aid of other conflicting assumptions. Bondarenko et al. 1997 ] also propose two new semantics generalising, respectively, the admissibility semantics [ Dung, 1991 ] and the semantics of preferred extensions [ Dung, 1991 ] and partial stable models [ Sacc a and Zaniolo, 1990 ] for LP. In abstract terms, a set of assumptions is an admissible argument of a given theory, iff it does not attack itself and it attacks all sets of assumptions which attack it. A set of assumptions is a preferred argument iff it is a ....
[Article contains additional citation context not shown here]
Phan Minh Dung. Negation as hypothesis: an abductive foundation for logic programming. In K. Furukawa, editor, Proceedings of the 8th International Conference on Logic programming, pages 3--17, Paris, France, 1991. MIT Press.
On the Computational Complexity of Assumption-based.. - Dimopoulos, Nebel (2002) (Correct)
No context found.
Phan Minh Dung. Negation as hypothesis: an abductive foundation for logic programming. In K. Furukawa, editor, Proceedings of the 8th International Conference on Logic Programming, pages 3-17, Paris, France, 1991. MIT Press.
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