On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks
From MaRDI portal
Publication:4444966
DOI10.1093/logcom/13.3.377zbMath1032.03518OpenAlexW2061482125MaRDI QIDQ4444966
Claudette Cayrol, Jérôme Mengin, Sylvie Doutre
Publication date: 28 January 2004
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/13.3.377
Logic in artificial intelligence (68T27) Knowledge representation (68T30) Logic in computer science (03B70)
Related Items
Reasoning about preferences in argumentation frameworks, Looking-ahead in backtracking algorithms for abstract argumentation, Probabilistic argumentation, Toward incremental computation of argumentation semantics: a decomposition-based approach, Argumentation for Practical Reasoning: An Axiomatic Approach, Logic-based argumentation with existential rules, On checking skeptical and ideal admissibility in abstract argumentation frameworks, Integrated preference argumentation and applications in consumer behaviour analyses, Fundamental properties of attack relations in structured argumentation with priorities, Dialectical Proof Theories for the Credulous Prudent Preferred Semantics of Argumentation, A QBF-based formalization of abstract argumentation semantics, Co-argumentation Artifact for Agent Societies, Abstract argument games via modal logic, Dialectic proof procedures for assumption-based, admissible argumentation, Algorithms for decision problems in argument systems under preferred semantics, Argumentation frameworks as constraint satisfaction problems, Audiences in argumentation frameworks, Argumentation in artificial intelligence, Computing ideal sceptical argumentation, An application of formal argumentation: fusing Bayesian networks in multi-agent systems, Encoding deductive argumentation in quantified Boolean formulae, Indepth combinatorial analysis of admissible sets for abstract argumentation, Probabilistic qualification of attack in abstract argumentation
