Yannis Dimopoulos, Bernhard Nebel, Francesco Toni  Home/Search
Context Related
| informatik.unifre...talijcai99.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: informatik.unifrei...conferences (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Based on an abstract framework for nonmonotonic reasoning, Bondarenko et al. have extended the logic programming semantics of admissible and preferred arguments to other nonmonotonic formalisms such as circumscription, auto-epistemic logic and default logic. Although the new semantics have been tacitly assumed to mitigate the computational problems of nonmonotonic reasoning under the standard semantics of stable extensions, it seems questionable whether they improve the worst-case behaviour.... (Update)
Context of citations to this paper: More
...s system does not provide any way to detect and avoid such situations. Secondly, there has always been a trade o between expressiveness and computation. As has been shown in [3], except for the case of skeptical admissible semantics which comes down to trivial monotonic...
Cited by: More
Book Title - Book Editors Ios (Correct)
Complexity in Value-Based Argument Systems - Paul Dunne And (2004) (Correct)
On the Computational Complexity of Assumption-based.. - Dimopoulos, Nebel (2002) (Correct)
Similar documents (at the sentence level):
58.1%: Preferred Arguments are Harder to Compute than Stable.. - Dimopoulos, Nebel, Toni (1999) (Correct)
19.3%: On the Computational Complexity of Assumption-Based.. - Dimopoulos, Nebel, Toni (2002) (Correct)
14.6%: Finding Admissible and Preferred Arguments Can be Very Hard - Dimopoulos, al. (2000) (Correct)
Active bibliography (related documents): More All
0.2: Contributions to the Complexity Analysis of Non-Monotonic.. - Baumgartner (2000) (Correct)
0.1: Disjunctive Logic Programming: A Survey And Assessment - Minker, Seipel (Correct)
0.1: Default Logic as a Query Language - Cadoli, Eiter, Gottlob (1997) (Correct)
Similar documents based on text: More All
0.4: Coherence in Finite Argument Systems - Dunne, Bench-Capon (2001) (Correct)
0.2: Integrating Explanatory and Descriptive Learning in ILP - Dimopoulos, Dzeroski (1996) (Correct)
0.2: E-RES: Reasoning about Actions, Events and Observations - Kakas, Miller (Correct)
Related documents from co-citation: More All
11: the acceptability of arguments and its fundamental role in nonmonotonic reasonin.. - Dung - 1995
7: Dialectic semantics for argumentation frameworks - Jakobovits, Vermeir - 1999
7: Finding admissible and preferred arguments can be very hard - Dimopoulos, Nebel et al.
BibTeX entry: (Update)
Yannis Dimopoulos, Bernhard Nebel, and Francesca Toni. Preferred arguments are harder to compute than stable extensions. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), Stockholm, Sweden, August 1999. Morgan Kaufmann. http://citeseer.ist.psu.edu/article/dimopoulos99preferred.html More
@inproceedings{ dimopoulos99preferred,
author = "Yannis Dimopoulos and Bernhard Nebel and Francesca Toni",
title = "Preferred Arguments are Harder to Compute than Stable Extension",
booktitle = "{IJCAI}",
pages = "36-43",
year = "1999",
url = "citeseer.ist.psu.edu/article/dimopoulos99preferred.html" }
Citations (may not include all citations):858 The stable model semantics for logic programming - Gelfond, Lifschitz - 1988
850 A logic for default reasoning (context) - Reiter - 1980
161 Complexity results for nonmonotonic logics (context) - Gottlob - 1992
150 Computational Complexity (context) - Papadimitriou - 1994
89 Nonmonotonic logic: contextdependent reasoning (context) - Marek, Truszczynski - 1993
68 Stable models and non-determinism in logic programs with neg.. - Sacca, Zaniolo - 1990
58 A survey of complexity results for nonmonotonic logics - Cadoli, Schaerf - 1993
48 The complexity of propositional default logics (context) - Stillman - 1992
32 argumentation-theoretic framework for default reasoning (context) - Bondarenko, Dung et al. - 1997
15 Expressive power and complexity of partial models for disjun.. - Eiter, Leone et al. - 1998
12 The expressive power of stable models for bound and unbound .. (context) - Sacca - 1997
11 The complexity of default reasoning under the stationary fix.. (context) - Gottlob - 1995
10 Towards automatic autoepistemic reasoning (context) - Niemela - 1990
6 Negation as hypothesis: an abductive foundation for logic pr.. (context) - Dung - 1991
6 Kowalski and Francesca Toni (context) - Robert - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.informatik.uni-freiburg.de/~nebel/conferences.html): More
Issues of Integration and Balancing in Hybrid Knowledge.. - Nebel, von Luck (1987) (Correct)
Reasoning about Temporal Relations: A Maximal Tractable.. - Nebel, Bürckert (1994) (Correct)
Complexity Results for SAS+ Planning - Bäckström, Nebel (1993) (Correct)
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