P Dung, R Kowalski, and F Toni. Argumentation-theoretic proof procedures for default reasoning. Technical report, Department of Computing, Imperial College, London, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On the Computational Complexity of Assumption-based.. - Dimopoulos, Nebel (2002) Self-citation (Toni) (Correct)
No context found.
Phan Minh Dung, Robert A. Kowalski, and Francesca Toni. Argumentation-theoretic proof procedures for default reasoning. Technical report, Imperial College, London, UK, 1998.
On the Computational Complexity of Assumption-Based.. - Dimopoulos, Nebel, Toni (2002) Self-citation (Toni) (Correct)
....arguments, however, a local search suffices. First, one has to construct a set of assumptions which, together with the given theory, monotonically) derives the sentence to be justified, and then one has to augment the constructed set with further assumptions to defend it against all attacks [18, 6, 7]. See [18, 7] for a more general discussion of the problems associated with computing the stability semantics. However, from a complexity theoretic point of view, it seems unlikely that the new semantics lead to better lower bounds than the standard semantics since all the sources of ....
....a local search suffices. First, one has to construct a set of assumptions which, together with the given theory, monotonically) derives the sentence to be justified, and then one has to augment the constructed set with further assumptions to defend it against all attacks [18, 6, 7] See [18, 7] for a more general discussion of the problems associated with computing the stability semantics. However, from a complexity theoretic point of view, it seems unlikely that the new semantics lead to better lower bounds than the standard semantics since all the sources of complexity one has in ....
Phan Minh Dung, Robert A. Kowalski, and Francesca Toni. Argumentationtheoretic proof procedures for default reasoning. Technical report, Imperial College, London, UK, 1998.
Finding Admissible and Preferred Arguments Can be Very Hard - Dimopoulos, al. (5 citations) Self-citation (Toni) (Correct)
....concrete logics for nonmonotonic reasoning, admissible and preferred arguments are always guaranteed to exist, whereas stable extensions are not. Finally, reasoning under the new semantics appears to be computationally easier than reasoning under the standard semantics [Kowalski and Toni, 1996; Dung et al. 1997] However, from a complexity theoretic point of view, it seems unlikely that the new semantics lead to better lower bounds than the standard semantics since all the sources of complexity one has in nonmonotonic reasoning are still present under the new semantics. There are potentially ....
....with respect to reasoning under the standard semantics. These conclusions confirm those drawn from earlier results for logic programming and default logic in [Eiter et al. 1998; Dimopoulos et al. 1999] These results seem to contradict the expectation, put forwards in [Bondarenko et al. 1997; Dung et al. 1997] that the new, argumentation theoretic semantics lead to computationally less involved nonmonotonic reasoning processes 2 See Section 3 for a summary of the results for the standard semantics. than the standard semantics. However, they do not contradict the expectation that in practice ....
Phan Minh Dung, Robert A. Kowalski, and Francesca Toni. Argumentation-theoretic proof procedures for default reasoning. Technical report, Imperial College, London, UK, 1997.
Finding Admissible and Preferred Arguments Can be Very Hard - Dimopoulos, al. (2000) (5 citations) Self-citation (Toni) (Correct)
....concrete logics for nonmonotonic reasoning, admissible and preferred arguments are always guaranteed to exist, whereas stable extensions are not. Finally, reasoning under the new semantics appears to be computationally easier than reasoning under the standard semantics [Kowalski and Toni, 1996; Dung et al. 1997] However, from a complexity theoretic point of view, it seems unlikely that the new semantics lead to better lower bounds than the standard semantics since all the sources of complexity one has in nonmonotonic reasoning are still present under the new semantics. There are potentially ....
....with respect to reasoning under the standard semantics. These conclusions confirm those drawn from earlier results for logic programming and default logic in [Eiter et al. 1998; Dimopoulos et al. 1999] These results seem to contradict the expectation, put forwards in [Bondarenko et al. 1997; Dung et al. 1997] that the new, argumentation theoretic semantics lead to computationally less involved nonmonotonic reasoning processes 2 See Section 3 for a summary of the results for the standard semantics. than the standard semantics. However, they do not contradict the expectation that in practice ....
Phan Minh Dung, Robert A. Kowalski, and Francesca Toni. Argumentation-theoretic proof procedures for default reasoning. Technical report, Imperial College, London, UK, 1997.
Hybrid Argumentation Systems for Structured News Reports - Hunter (2001) (2 citations) (Correct)
No context found.
P Dung, R Kowalski, and F Toni. Argumentation-theoretic proof procedures for default reasoning. Technical report, Department of Computing, Imperial College, London, 1998.
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