arXiv (All)
open access
Complexity of Grounded Semantics and Preferred Semantics in Finitary Argumentation Frameworks
Abstract argumentation frameworks (AFs) introduced by Dung provide a formal foundation for non-monotonic reasoning in artificial intelligence. While decision problems for general infinite AFs typically reside at high levels of the analytical hierarchy ($Σ_1^1$ or $Π_1^1$), restricting the framework
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Exploring the System 1 Thinking Capability of Large Reasoning Models#189255
- Considering the roles of values in practical reasoning argumentation evaluation#698622
- Semantics out of context: nominal absolute denotations for first-order logic and computation#149126
- Argumentative landscapes: the function of models in social epistemology#84443
- A Benacerraf Problem for Higher-Order Metaphysics#70894
Record · ID 1249288
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive