Generalized Abstract Argumentation: Handling Arguments in FOL Fragments

DOI10.1007/978-3-642-02906-6_14MaRDI QIDQ3638145zbMATH OpenOpenAlexFDO

Authors Martín O. Moguillansky, Nicolás D. Rotstein, Marcelo A. Falappa, Guillermo R. Simari

Publication date 2 July 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02906-6_14

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Games involving topology, set theory, or logic (91A44) Subsystems of classical logic (including intuitionistic logic) (03B20)

Recommendations

• Sets of attacking arguments for inconsistent Datalog knowledge bases
• On the instantiation of knowledge bases in abstract argumentation frameworks
• A Generalization of Dung’s Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments
• Logic-based argumentation with existential rules
• Logical limits of abstract argumentation frameworks

Cites work

• scientific article; zbMATH DE number 1418279 (Why is no real title available?)
• Abstract argumentation systems
• On principle-based evaluation of extension-based argumentation semantics
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games

Cited in

(6)

• On the instantiation of knowledge bases in abstract argumentation frameworks
• An approach to generating arguments over DL-Lite ontologies
• Sets of attacking arguments for inconsistent Datalog knowledge bases
• An Algorithm for Generating Arguments in Classical Predicate Logic
• Paraconsistency and plausible argumentation in generative grammar: A case study
• Towards a general theory of decomposability in abstract argumentation

This page was built for publication: Generalized Abstract Argumentation: Handling Arguments in FOL Fragments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638145)