Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(4)
Default Logic
Epistemic Logic
Logic Programs
nonmonotonic reasoning
Related Publications
(4)
Preferred Extensions of Argumentation Frameworks: Query Answering and Computation
On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and nPerson Games
An Abstract, Arg...
Computing Preferred Extensions for Argumentation Systems with Sets of Attacking Arguments
Subscribe
Academic
Publications
Preferred Arguments are Harder to Compute than Stable Extension
Preferred Arguments are Harder to Compute than Stable Extension,Yannis Dimopoulos,Bernhard Nebel,Francesca Toni
Edit
Preferred Arguments are Harder to Compute than Stable Extension
(
Citations: 19
)
BibTex

RIS

RefWorks
Download
Yannis Dimopoulos
,
Bernhard Nebel
,
Francesca Toni
Based on an abstract framework for nonmonotonicreasoning, Bondarenko et al. have extendedthe logic programming semantics of admissible and preferred arguments to other nonmonotonicformalisms such as circumscription,autoepistemic logic and default logic. Althoughthe new semantics have been tacitly assumedto mitigate the computational problemsof
nonmonotonic reasoning
under the standardsemantics of stable extensions, it seems questionablewhether they improve the worstcase...
Conference:
International Joint Conference on Artificial Intelligence  IJCAI
, pp. 3643, 1999
Cumulative
Annual
Citation Context
(4)
...Also, the complexity of acceptability has been studied in the context of assumptionbased frameworks [BDKT97], in [
DNT99
, DNT00, DNT02]...
...The corresponding decision problems in ABFs have been studied separately, and results exist [
DNT99
, DNT00, DNT02] on the complexity of various semantics, generally situated in the first four levels of the polynomial hierarchy...
Robin Hirsch
,
et al.
The Complexity of the Warranted Formula Problem in Propositional Argum...
...In general it is hard to compute a preferred extension [
23
], but [24] presents a method that enumerates preferred extensions for an abstract argumentation system as p resented in [16]...
Søren Holbech Nielsen
,
et al.
Computing Preferred Extensions for Argumentation Systems with Sets of ...
...Concerning admissible extensions, by applying Theorem 2 in [
4
], the encoding can now be considerably simplified for flat frameworks...
Uwe Egly
,
et al.
Reasoning in Argumentation Frameworks Using Quantified Boolean Formula...
...In general it is hard to compute a preferred extension [
14
], b ut in [15] we have adapted a technique of [16] to the problem of enumerating preferred extensions of argumentation systems of [12]: Given A ≡ (A, ⊲), we define an Acandidate as a triple (I, O, U ≡ A \ (I ∪ O)) where • I ∩ O = ?, • every argument that is attacked by I is in O, and • every argument A, for which there exists S ⊆ I and B ∈ I, such that S ∪ A ⊲ B, is in O. (Here I ...
Søren Holbech Nielsen
,
et al.
An Application of Formal Argumentation: Fusing Bayes Nets in MAS
References
(12)
The Stable Model Semantics for Logic Programming
(
Citations: 1790
)
Michael Gelfond
,
Vladimir Lifschitz
Conference:
International Conference on Logic Programming/Joint International Conference and Symposium on Logic Programming  ICLP(JICSLP)
, pp. 10701080, 1988
Complexity Results for Nonmonotonic Logics
(
Citations: 252
)
Georg Gottlob
Journal:
Journal of Logic and Computation  LOGCOM
, vol. 2, no. 3, pp. 397425, 1992
Expressive Power and Complexity of Partial Models for Disjunctive Deductive Databases
(
Citations: 22
)
Thomas Eiter
,
Nicola Leone
Published in 1999.
Stable models and nondeterminism in logic programs with negation
(
Citations: 160
)
Domenico Sacccit
,
Carlo Zaniolo
Conference:
Symposium on Principles of Database Systems  PODS
, pp. 205217, 1990
A Logic for Default Reasoning
(
Citations: 2062
)
Raymond Reiter
Journal:
Artificial Intelligence  AI
, vol. 13, no. 12, pp. 81132, 1980
Sort by:
Citations
(19)
The Complexity of the Warranted Formula Problem in Propositional Argumentation
(
Citations: 4
)
Robin Hirsch
,
Nikos Gorogiannis
Journal:
Journal of Logic and Computation  LOGCOM
, vol. 20, no. 2, pp. 481499, 2010
The computational complexity of ideal semantics
(
Citations: 10
)
Paul E. Dunne
Journal:
Artificial Intelligence  AI
, vol. 173, no. 18, pp. 15591591, 2009
Computing Preferred Extensions for Argumentation Systems with Sets of Attacking Arguments
(
Citations: 9
)
Søren Holbech Nielsen
,
Simon Parsons
Conference:
Computational Models of Argument  COMMA
, pp. 97108, 2006
Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas
(
Citations: 6
)
Uwe Egly
,
Stefan Woltran
Conference:
Computational Models of Argument  COMMA
, pp. 133144, 2006
An Application of Formal Argumentation: Fusing Bayes Nets in MAS
(
Citations: 2
)
Søren Holbech Nielsen
,
Simon Parsons
Conference:
Computational Models of Argument  COMMA
, pp. 3344, 2006