2002•Artificial IntelligenceOpen access

On the computational complexity of assumption-based argumentation for default reasoning

Yannis Dimopoulos, Bernhard Nebel, Francesca Toni

Open full text 89 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 89 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Default logic, Non-monotonic logic, Circumscription, Autoepistemic logic, Rotation formalisms in three dimensions, Stable model semantics, Well-founded semantics, Deductive reasoning

Back to paper search Browse research topics Original source

On the computational complexity of assumption-based argumentation for default reasoning — Research Paper | ScholarLens