, ? b (X ) ? c (X ) ? ?), ?X (e (X ) ? d (X ) ? ?)}. The corresponding argumentation framework is composed of 161 attacks and the following 20 arguments: ? a 0 : ({a(m)}, {a(m)})
, ? a 1 : ({b (m)}, {b (m)})
, ? a 2 : ({a(m), b (m)}, {a(m), b (m)})
, ? a 3 : ({c (m)}, {c (m)})
, ? a 4 : ({a(m), c (m)}, {a(m), c (m)})
, ? a 5 : ({b (m), c (m)}, {b (m), c (m)})
, ? a 6 : ({d (m)}, {d (m)})
, ? a 7 : ({a(m), d (m)}, {a(m), d (m)})
, ? a 8 : ({b (m), d (m)}, {b (m), d (m)})), d (m)})
, ? a 9 : ({a(m), b (m), d (m)}, {a(m), b (m), d (m)})
, ? a 10 : ({c (m), d (m)}, {c (m), d (m)})
, ? a 11 : ({a(m), c (m), d (m)}, {a(m), c (m), d (m)})
, ? a 12 : ({b (m), c (m), d (m)}, {b (m), c (m), d (m)})
, ? a 13 : ({e (m)}, {e (m)})
, ? a 14 : ({a(m), e (m)}, {a(m), e (m)})
, ? a 15 : ({b (m), e (m)}, {b (m), e (m)})
, ? a 16 : ({a(m), b (m), e (m)}, {a(m), b (m), e (m)})
, ? a 17 : ({c (m), e (m)}, {c (m), e (m)})
, ? a 18 : ({a(m), c (m), e (m)}, {a(m), c (m), e (m)})
, The set of cf2 extensions is the set {? 1, ? a 19 : ({b (m), c (m), e (m)}, {b (m), c (m), e (m)}) The preferred extensions will be composed of the following sets: ? ? 1 = {a 0, vol.3
, 11 (Characterisation of dummy arguments) Let KB = (F, R, N) be knowledge base such that R = ? and |F| = n, vol.3
, Att + (a) = ?}, the set of dummy arguments. 1. Let us prove that |U nn| ? 2 k ? 1. The set Free (KB) corresponds to the set of facts that are not in any conflict. Since k = |Free (KB)|, we conclude that there are at least 2 k ?1 arguments of the form (X , X ) that have a non empty subset X of Free (KB) as support, Let us consider U nn = {a ? A | Att ? (a) =
, Let us prove that |U nn| ? 2 k ? 1. By means of contradiction, we suppose that |U nn| > 2 k ? 1. It means that that there is a dummy argument a ? U nn such that Supp(a) Free (KB). Thus, there exists a minimal inconsistent set X ? MI (KB)
We know that Y is not empty otherwise there is a contradiction with the consistency of the support of a. Furthermore, Y is R-consistent since Y ? X . Thus, there is an argument b = (Y , Y ) such that (b, a) ? R, contradiction. Proposition 3.12 (Number of arguments) Let KB = (F, R, N) be a knowledge base with R = ?. If |Free (KB)| = k then there is a subgraph of F KB = (A , R) that is a (2 k )-cop graph of ,
, If Free (KB) = ?, then it is obvious that F KB is a 1-cop graph of itself
, Hence, |A | = |{X | X is a non empty R-consistent subset of F \ Free (KB)}|. Now, let us consider F KB = (A , R), the argumentation framework corresponding to the knowledge base KB. We show that the subgraph F KB = (A , R ) of F KB where A = {a ? A | Supp(a) Free (KB)} and R = R |A is a (2 |F r ee (KB) | )-cop graph of F KB : ? We know that for any set X that is an R-consistent subset of F \ Free (KB), X ?X , where X is a subset of Free (KB), is an R-consistent set. Thus |A | = |{X ? X | X ? Free (KB) and X is a non empty R-consistent subset of F \ Free (KB)}|, Moreover, since R = ?, the arguments can only be of the form (X , X ) where X is an R-consistent subset of F \ Free (KB)
, We denote by f the function from A to A such that f (a ) = a iff Supp(a ) = Supp(a ) ? (F \ Free (KB)). We now show that this function CHAPTER
, Let ? ? Sat R (Output x (F KB )). Then there exist a minimal set {? 1 , . . . , ? k } ? Output x (F KB ) and a sequence of rule applications such that ? is produced from {? 1 , . . . , ? k }. Since ? 1 , . . . , ? k ? Output x (F KB ) then for every E ? Ext x (F KB ), we have ? 1
, From the first part of the proof, Sat R (Concs (E)) = Concs (E). Thus, for every E ? Ext x (F KB ), ? ? Concs (E). Thus, ? ? Output x (F KB )
, Given a logical argumentation framework F K = (A , R) with A being the set of arguments defined by Definition 3.1 and R the set of attacks defined according to Definition 3.2, the set R enjoys the following properties: 1. C1b : for every a, b, c ? A , if Conc (a) Conc (b) then
, C2b : for every a, b, c ? A , if Supp(a) Supp(b) then ((c, a) ? R if and only if (c, b) ? R)
, ) be a knowledge base expressed using existential rules and F KB = (A , R) the corresponding argumentation framework. Now
, Suppose that Conc (a)
, Conc (b). If (a, c) ? R, it means that there exists ? ? Supp(c) such that Sat R?N (Conc (a) ?{?}) |= ?. However, since Conc (a) Conc (b), we can infer that Sat R (Conc (a)) = Sat R (Conc (b)), thus Sat R?N (Conc (b) ? {?}) |= ? and (b, c) ? R. Likewise
, Conc (c) ?{?}) |= ?. However, since Supp(a) Supp(b), by definition, we have that there exists ? ? Supp(b) s.t. ? ?, i.e. Sat R (? ) = Sat R (?). Therefore, we can infer that Sat R (Conc (c) ? {? }) |= ? and (c, b) ? R. Likewise, (c, b) ? R implies (c, a) ? R which ends the proof, Suppose now that Supp(a) Supp(b). If (c, a) ? R, it means that there exists ? ? Supp(a) such that Sat R?N, vol.50, p.93
, Bipolar argumentation framework 114
,
, Boolean conjunctive query, vol.17, p.30
, , p.149
,
, Burden-based ranking-based semantics
, , vol.36, p.63
,
,
,
, , vol.26
, , vol.35, p.37
,
, , p.36
, , vol.49, p.50
, , p.24
, Conflict-based argument, p.55
, Conflict-based complete graph, p.55
, , vol.34, p.94
, , vol.27, p.28
, , vol.14, p.15
, , p.17
,
,
, , vol.116, p.118
, , p.136
, , vol.126, p.133
,
, , vol.55, p.135
,
, Deductive argumentation, vol.7, p.49
, Defeasible logic programming
,
, , vol.7, p.48
, , vol.82, p.105
, , vol.18, p.19
, Derivation for a fact, vol.19, p.20
, , vol.33, p.132
, Discussion-based ranking-based semantics
, , p.133
, Distributed-defense precedence, p.133
, , vol.72, p.106
,
, Drastic Shapley inconsistency value 143, p.146
, , vol.56
3 Exhaustive breadth-first derivation 20 Existence property ,
,
, , vol.23, p.51
, Filtrated argumentation framework 68
, Filtrated set of arguments, p.67
see FES Finite unification set . . . . . . see FUS First-order logic, vol.1, p.14 ,
, , p.40
,
,
, , vol.31, p.57
,
, , vol.18, p.21
, , vol.21, p.22
,
,
, , vol.72, p.80
24 GRD see Graph of rule dependency Greedy bounded tree-width set . see GBTS Ground atom, vol.35, p.97 ,
, , p.39
135 H H-categoriser function, p.41 ,
, H-categoriser ranking-based semantics
,
,
, , vol.16, p.17
, , p.17
, Hypergraph argumentation framework 92
,
, , vol.35, p.37
,
, , vol.3, p.29
3, 28, 29 Inconsistency measure, vol.143, p.144 ,
,
,
, , vol.33, p.38
, , p.83
, , vol.7, p.14
, , p.41
143, 144 xx INDEX Logic-based argumentation, vol.143, p.146 ,
, Minimal inconsistent set, p.31
, , p.149
16 Model faithful acyclicity . . see MFA More restrictive equivalence relation 122 ,
, , vol.126, p.28
, , p.136
, , p.136
, Nh-categoriser ranking-based semantics
, Non entailment ejection, p.151
, Non-attacked equivalence . see NaE Non-trivial
, , vol.30, p.142
, , p.23
,
, , vol.33, p.131
, , vol.13, p.21
,
, , p.24
, Ranking-based semantics, vol.39, p.114
, , p.99
, , vol.52, p.54
4, 31, 95 Repair semantics ,
, , p.23
, , vol.143, p.144
,
, Rule-based logics
, Saturated set of facts, vol.40, p.41
, , vol.126, p.136
, Self-attacking argument, vol.54, p.98
, , p.133
, Semi-stable extension, vol.35, p.54
, , vol.68, p.94
, , vol.33, p.94
, Set of attacking argument, vol.67, p.91
,
,
, , vol.16, p.21
, , pp.23-25
36 Strict addition of defense branch 134 Strict counter-transitivity . see, vol.36, p.83 ,
,
, , vol.49, p.50
, Support argumentation framework 114
, , p.151
,
,
,
,
, Foundations of Databases, vol.52, 1995.
Postulates for logic-based argumentation systems, Int. J. Approx. Reasoning, vol.55, issue.9, pp.2028-2048, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01123709
Ranking-Based Semantics for Argumentation Frameworks, Scalable Uncertainty Management -7th International Conference, SUM 2013, pp.134-147, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-01239719
Argumentation-based Ranking Logics, Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, pp.1511-1519, 2015. ,
Evaluation of Arguments from Support Relations: Axioms and Semantics, Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, pp.900-906, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01530271
Ranking Arguments With Compensation-Based Semantics, Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, pp.12-21, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01530417
Acceptability Semantics for Weighted Argumentation Frameworks, Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, pp.56-62, 2017. ,
Bridging the Gap between Abstract Argumentation Systems and Logic, Scalable Uncertainty Management, Third International Conference, pp.12-27, 2009. ,
A Formal Analysis of Logic-Based Argumentation Systems, Scalable Uncertainty Management -4th International Conference, SUM 2010, pp.42-55, 2010. ,
Equivalence in logic-based argumentation, Journal of Applied Non-Classical Logics, vol.24, issue.3, pp.181-208, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01123719
Towards a consensual formal model: inference part, 2004. ,
On the Acceptability of Arguments in Preference-based Argumentation, UAI '98: Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, pp.1-7, 1998. ,
On bipolarity in argumentation frameworks, Int. J. Intell. Syst, vol.23, issue.10, pp.1062-1093, 2008. ,
Modelling dialogues using argumentation, Proceedings Fourth International Conference on MultiAgent Systems, pp.31-38, 2000. ,
A Family of Defeasible Reasoning Logics and its Implementation, ECAI 2000, Proceedings of the 14th European Conference on Artificial Intelligence, pp.459-463, 2000. ,
Consistent Query Answers in Inconsistent Databases, Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp.68-79, 1999. ,
Formalizing and Studying Dialectical Explanations in Inconsistent Knowledge Bases, 2016. ,
URL : https://hal.archives-ouvertes.fr/tel-01448733
DALEK: A Tool for Dialectical Explanations in Inconsistent Knowledge Bases, Computational Models of Argument -Proceedings of COMMA 2016, pp.461-462, 2016. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01337019
Logic-based argumentation with existential rules, Int. J. Approx. Reasoning, vol.90, pp.76-106, 2017. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01596666
Description Logics as Ontology Languages for the Semantic Web, Mechanizing Mathematical Reasoning, Essays in Honor of Jörg H. Siekmann on the Occasion of His 60th Birthday, pp.228-248, 2005. ,
A General Modifier-Based Framework for Inconsistency-Tolerant Query Answering, Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, pp.513-516, 2016. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01328690
Inconsistency-Tolerant Query Answering: Rationality Properties and Computational Complexity Analysis, Logics in Artificial Intelligence -15th European Conference, pp.64-80, 2016. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01412864
Extending Acyclicity Notions for Existential Rules, -Including Prestigious Applications of Intelligent Systems (PAIS 2014), pp.39-44, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01092757
Revisiting Chase Termination for Existential Rules and their Extension to Nonmonotonic Negation, 2014. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01097136
Datalog+, RuleML and OWL 2: Formats and Translations for Existential Rules, Proceedings of the RuleML 2015 Challenge, the Special Track on Rule-based Recommender Systems for the Web of Data, the Special Industry Track and the RuleML 2015 Doctoral Consortium hosted by the 9th International Web Rule Symposium, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01172069
DLGP: An extended Datalog Syntax for Existential Rules and Datalog+, 2015. ,
Graal: A Toolkit for Query Answering with Existential Rules, Rule Technologies: Foundations, Tools, and Applications -9th International Symposium, pp.328-344, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01172063
ABAplus: Attack Reversal in Abstract and Structured Argumentation with Preferences, PRIMA 2017: Principles and Practice of Multi-Agent Systems -20th International Conference, vol.175, pp.420-437, 2011. ,
An introduction to argumentation semantics, Knowledge Eng. Review, vol.26, issue.4, pp.365-410, 2011. ,
Automatic evaluation of design alternatives with quantitative argumentation, Argument & Computation, vol.6, issue.1, pp.24-49, 2015. ,
The Implication Problem for Data Dependencies, Automata, Languages and Programming, 8th Colloquium, pp.73-85, 1981. ,
Non-Objection Inference for Inconsistency-Tolerant Query Answering, Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, vol.2016, pp.3684-3690, 2016. ,
Some Syntactic Approaches to the Handling of Inconsistent Knowledge Bases: A Comparative Study Part 1: The Flat Case, Studia Logica, vol.58, issue.1, pp.17-45, 1997. ,
Introduction to Inconsistency Tolerance, Inconsistency Tolerance, pp.1-14, 2005. ,
Introduction to structured argumentation, Argument & Computation, vol.5, issue.1, pp.1-4, 2014. ,
A logic-based theory of deductive arguments, Artif. Intell, vol.128, issue.1-2, pp.203-235, 2001. ,
Elements of Argumentation, 2008. ,
Constructing argument graphs with deductive arguments: a tutorial, Argument & Computation, vol.5, issue.1, pp.5-30, 2014. ,
On the Complexity of Consistent Query Answering in the Presence of Simple Ontologies, Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00789141
Argument Molecules: A Functional Representation of Argument Structure, Proceedings of the National Conference on Artificial Intelligence, pp.63-65, 1982. ,
Towards an AI Model of Argumentation, Proceedings of the 1st Annual National Conference on Artificial Intelligence, pp.313-315, 1980. ,
An AssumptionBased Framework for Non-Monotonic Reasoning, LPNMR, pp.171-189, 1993. ,
Arguing for Decisions: A Qualitative Model of Decision Making, UAI '96: Proceedings of the Twelfth Annual Conference on Uncertainty in Artificial Intelligence, pp.98-105, 1996. ,
A Comparative Study of Ranking-Based Semantics for Abstract Argumentation, Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, pp.914-920, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01263996
Combining Extension-Based Semantics and Ranking-Based Semantics for Abstract Argumentation, Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, pp.118-127, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01900735
Inconsistency Handling in Ontology-Mediated Query Answering, 2016. ,
URL : https://hal.archives-ouvertes.fr/tel-01378723
Preferred Subtheories: An Extended Logical Framework for Default Reasoning, Proceedings of the 11th International Joint Conference on Artificial Intelligence, pp.1043-1048, 1989. ,
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints, J. Artif. Intell. Res, vol.48, pp.115-174, 2013. ,
A general datalog-based framework for tractable query answering over ontologies, Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp.77-86, 2009. ,
A general Datalog-based framework for tractable query answering over ontologies, J. Web Sem, vol.14, pp.57-83, 2012. ,
, , 2010.
A Family of Logical Knowledge Representation and Query Languages for New Applications, Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, pp.228-242, 2010. ,
Advanced Processing for Ontological Queries, PVLDB, vol.3, issue.1, pp.554-565, 2010. ,
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family, J. Autom. Reasoning, vol.39, issue.3, pp.385-429, 2007. ,
On the Issue of Reinstatement in Argumentation, Logics in Artificial Intelligence, 10th European Conference, pp.111-123, 2006. ,
Comparing two unique extension semantics for formal argumentation: ideal and eager, Proceedings of the 19th Belgian-Dutch conference on artificial intelligence (BNAIC 2007), pp.81-87, 2007. ,
On the evaluation of argumentation formalisms, Artif. Intell, vol.171, issue.5-6, pp.286-310, 2007. ,
On judgment aggregation in abstract argumentation, Autonomous Agents and Multi-Agent Systems, vol.22, issue.1, pp.64-102, 2011. ,
Semi-stable semantics, J. Log. Comput, vol.22, issue.5, pp.1207-1254, 2012. ,
Graduality in Argumentation, J. Artif. Intell. Res. (JAIR), vol.23, pp.245-297, 2005. ,
URL : https://hal.archives-ouvertes.fr/hal-01925532
What you Always Wanted to Know About Datalog (And Never Dared to Ask), IEEE Trans. Knowl. Data Eng, vol.1, issue.1, pp.146-166, 1989. ,
Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach, Theory and Applications of Formal Argumentation -Second International Workshop, TAFA 2013, pp.176-193, 2013. ,
Embedded Implicational Dependencies and their Inference Problem, Proceedings of the 13th Annual ACM Symposium on Theory of Computing, pp.342-354, 1981. ,
Graph-based Knowledge Representation -Computational Foundations of Conceptual Graphs. Advanced Information and Knowledge Processing, 2009. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00355336
A Relational Model of Data for Large Shared Data Banks, Commun. ACM, vol.13, issue.6, pp.377-387, 1970. ,
Analyzing the Structure of Argumentative Discourse, Computational Linguistics, vol.13, issue.1-2, pp.11-24, 1987. ,
The birth of Prolog, History of programming languages-II, pp.331-367, 1996. ,
Symmetric Argumentation Frameworks, Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 8th European Conference, pp.317-328, 2005. ,
URL : https://hal.archives-ouvertes.fr/hal-00014624
Weighted Attacks in Argumentation Frameworks, Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00866890
Introducing Preference-Based Argumentation to Inconsistent Ontological Knowledge Bases, PRIMA 2015: Principles and Practice of Multi-Agent Systems -18th International Conference, pp.594-602, 2015. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01242937
What Can Argumentation Do for Inconsistent Ontology Query Answering?, Scalable Uncertainty Management -7th International Conference, SUM 2013, pp.15-29, 2013. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00936486
Complexity and expressive power of logic programming, ACM Comput. Surv, vol.33, issue.3, pp.374-425, 2001. ,
Sémantiqueà base de Classement pour l'Argumentation Abstraite), Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp.149-158, 2008. ,
Preferred Arguments are Harder to Compute than Stable Extension, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, vol.99, pp.36-43, 1450. ,
On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games, Artif. Intell, vol.77, issue.2, pp.321-358, 1995. ,
Dialectic proof procedures for assumption-based, admissible argumentation, Artif. Intell, vol.170, issue.2, pp.114-159, 2006. ,
Computing ideal sceptical argumentation, Artif. Intell, vol.171, pp.642-674, 2007. ,
Coherence in finite argument systems, Artif. Intell, vol.141, issue.1, pp.187-203, 2002. ,
Weighted argument systems: Basic definitions, algorithms, and complexity results, Artif. Intell, vol.175, issue.2, pp.457-486, 2011. ,
Complexity of Abstract Argumentation, In Argumentation in Artificial Intelligence, pp.85-104, 2009. ,
ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming, Logic Programming, 24th International Conference, pp.734-738, 2008. ,
Data exchange: semantics and query answering, Theor. Comput. Sci, vol.336, issue.1, pp.89-124, 2005. ,
Inconsistencies, Negations and Changes in Ontologies, Proceedings, The Twenty-First National Conference on Artificial Intelligence and the Eighteenth Innovative Applications of Artificial Intelligence Conference, pp.1295-1300, 2006. ,
Handbook of logic in artificial intelligence and logic programming, 1993. ,
, Equilibrium States in Numerical Argumentation Networks. Logica Universalis, vol.9, pp.411-473, 2015.
A Comprehensive Analysis of the cf2 Argumentation Semantics: From Characterization to Implementation, 2013. ,
The cf2 argumentation semantics revisited, J. Log. Comput, vol.23, issue.5, pp.925-949, 2013. ,
Logic Approach to Knowledge and Data Bases at ECRC, IEEE Data Eng. Bull, vol.10, issue.4, pp.2-9, 1987. ,
Deliberative stock market agents using jinni and defeasible logic programming, esaw'00 engineering societies in the agents' world, workshop of ecai, 2000. ,
Defeasible Logic Programming: An Argumentative Approach, TPLP, vol.4, issue.1-2, pp.95-138, 2004. ,
The Zeno Argumentation Framework, Proceedings of the Sixth International Conference on Artificial Intelligence and Law, ICAIL '97, pp.10-18, 1997. ,
Measuring the Good and the Bad in Inconsistent Information, IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp.2632-2637, 2011. ,
Acyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies, J. Artif. Intell. Res, vol.47, pp.741-808, 2013. ,
Boosting a Complete Technique to Find MSS and MUS Thanks to a Local Search Oracle, IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, pp.2300-2305, 2007. ,
Opponent Modelling in Persuasion Dialogues, IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, pp.164-170, 2013. ,
On the Chase for All Provenance Paths with Existential Rules, Defeasible reasoning for existential rules. (Raisonnement defaisable dans les règles existentielles), pp.135-150, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01606503
Argumentation-Based Defeasible Reasoning For Existential Rules, Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, vol.2017, pp.1568-1569, 2017. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01520171
On the measure of conflicts: Shapley Inconsistency Values, Artif. Intell, vol.174, issue.14, pp.1007-1026, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00868381
On Supported Inference and Extension Selection in Abstract Argumentation Frameworks, Symbolic and Quantitative Approaches to Reasoning with Uncertainty -13th, 2015. ,
, Proceedings, pp.49-59, 2015.
Extending Decidable Existential Rules by Joining Acyclicity and Guardedness, IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp.963-968, 2011. ,
CoQuiAAS: A Constraint-Based Quick Abstract Argumentation Solver, 27th IEEE International Conference on Tools with Artificial Intelligence, vol.2015, pp.928-935, 2015. ,
On ASPIC+ and Defeasible Logic, Computational Models of Argument -Proceedings of COMMA 2016, pp.359-370, 2016. ,
Social Abstract Argumentation, IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp.2287-2292, 2011. ,
Inconsistency-Tolerant Semantics for Description Logics, Web Reasoning and Rule Systems -Fourth International Conference, RR 2010, Bressanone, pp.103-117, 2010. ,
Inconsistency-tolerant query answering in ontology-based data access, J. Web Sem, vol.33, pp.3-29, 2015. ,
Consistent Query Answering over Description Logic Ontologies, Web Reasoning and Rule Systems, First International Conference, pp.194-208, 2007. ,
Expressiveness and tractability in knowledge representation and reasoning, Computational Intelligence, vol.3, pp.78-93, 1987. ,
From Classical to Consistent Query Answering under Existential Rules, Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, pp.1546-1552, 2015. ,
Generalized schema-mappings: from termination to tractability, Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2009, pp.13-22, 2009. ,
Inconsistency-Tolerant Reasoning in Datalog +/-Ontologies via an Argumentative Semantics, Advances in Artificial Intelligence -IB-ERAMIA 2014 -14th Ibero-American Conference on AI, pp.15-27, 2014. ,
A general account of argumentation with preferences, Artif. Intell, vol.195, pp.361-397, 2013. ,
The ASPIC+ framework for structured argumentation: a tutorial, Argument & Computation, vol.5, issue.1, pp.31-62, 2014. ,
Computing Preferred Extensions for Argumentation Systems with Sets of Attacking Arguments, Computational Models of Argument: Proceedings of COMMA 2006, pp.97-108, 2006. ,
A Generalization of Dung's Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments, Argumentation in Multi-Agent Systems, pp.54-73, 2007. ,
Algorithms for decision problems in argument systems under preferred semantics, Data Exchange, Integration, and Streams, vol.207, pp.1-37, 2013. ,
ASP modulo CSP: The clingcon system, TPLP, vol.12, issue.4-5, pp.485-503, 2012. ,
Computational Complexity, 1994. ,
Changing One's Mind: Erase or Rewind?, IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp.164-171, 2011. ,
Linking Data to Ontologies, J. Data Semantics, vol.10, pp.133-173, 2008. ,
Defeasible Reasoning, Cognitive Science, vol.11, issue.4, pp.481-518, 1987. ,
Defeasible reasoning with variable degrees of justification, Artif. Intell, vol.133, issue.1-2, pp.233-282, 2001. ,
On the Comparison of Theories: Preferring the Most Specific Explanation, Proceedings of the 9th International Joint Conference on Artificial Intelligence, pp.144-147, 1985. ,
Formal systems for persuasion dialogue, Knowledge Eng. Review, vol.21, issue.2, pp.163-188, 2006. ,
Argument Ranking with Categoriser Function. CoRR, abs/1406, p.3877, 2014. ,
DiscontinuityFree Decision Support with Quantitative Argumentation Debates, Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, pp.63-73, 2016. ,
On inference from inconsistent premisses, vol.1, 1970. ,
Interrogation tolérante aux incohérences, 2013. ,
Querying Existential Rule Knowledge Bases: Decidability and Complexity, 2016. ,
URL : https://hal.archives-ouvertes.fr/tel-01483770
Sound and Complete Forward and backward Chainingd of Graph Rules, Conceptual Structures: Knowledge Representation as Interlingua, 4th International Conference on Conceptual Structures, ICCS '96, pp.248-262, 1996. ,
Conceptual Graphs for a Data Base Interface, IBM Journal of Research and Development, vol.20, issue.4, pp.336-357, 1976. ,
Prioritized repairing and consistent query answering in relational databases, Ann. Math. Artif. Intell, vol.64, issue.2-3, pp.209-246, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00643104
A Food Packaging Use Case for Argumentation, Metadata and Semantics Research: 8th Research Conference, pp.344-358, 2014. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01089612
Eco-Efficient Packaging Material Selection for Fresh Produce: Industrial Session, Graph-Based Representation and Reasoning: 21st International Conference on Conceptual Structures, pp.305-310, 2014. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01089599
On Some Fundamental Concepts of Metamathematics, Logic, Semantics, Methamathematics, 1936. ,
The Tweety Library Collection for Logical Aspects of Artificial Intelligence and Knowledge Representation, KI, vol.31, issue.1, pp.93-97, 2017. ,
Reasoning on the Web with Assumption-Based Argumentation, Reasoning Web. Semantic Technologies for Advanced Query Answering -8th International Summer School, pp.370-386, 2012. ,
A generalised framework for dispute derivations in assumption-based argumentation, Artif. Intell, vol.195, pp.1-43, 2013. ,
A tutorial on assumption-based argumentation, Argument & Computation, vol.5, issue.1, pp.89-117, 2014. ,
Two Approaches to Dialectical Argumentation: Admissible Sets and Argumentation Stages, 1999. ,
Technical Note: On the Complexity of the Uniqueness Problem in Abstract Argumentation, 2017. ,
Arguing About End-of-Life of Packagings: Preferences to the Rescue, Metadata and Semantics Research -10th International Conference, pp.119-131, 2016. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01401481
Choice of environment-friendly food packagings through argumentation systems and preferences, Ecological Informatics, vol.48, pp.24-36, 2018. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01892712
An Argumentation Workflow for Reasoning in Ontology Based Data Access, Computational Models of Argument -Proceedings of COMMA 2016, pp.61-68, 2016. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01401316
Are Ranking Semantics Sensitive to the Notion of Core?, Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, vol.2017, pp.943-951, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01605720
Graph Theoretical Properties of Logic Based Argumentation Frameworks, Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, pp.2148-2149, 2018. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01892594
NAKED: N-Ary graphs from Knowledge bases Expressed in Datalog+, Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019. ,
URL : https://hal.archives-ouvertes.fr/lirmm-02180395
DAGGER: Datalog+/-Argumentation Graph GEneRator, Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2018, pp.1841-1843, 2018. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01892588
Graph Theoretical Properties of Logic Based Argumentation Frameworks: Proofs and General Results, Graph Structures for Knowledge Representation and Reasoning -5th International Workshop, pp.118-138, 2017. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01892703
Defining Argumentation Attacks in Practice: An Experiment in Food Packaging Consumer Expectations, Graph-Based Representation and Reasoning -23rd International Conference on Conceptual Structures, ICCS 2018, pp.73-87, 2018. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01892545
Toward a More Efficient Generation of Structured Argumentation Graphs, Proceedings of the 7th International Conference on Computational Models of Argument, vol.2018, pp.11-14, 2018. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01892707
Inconsistency Measures for Repair Semantics in OBDA, Proceedings of the TwentySeventh International Joint Conference on Artificial Intelligence, IJCAI 2018, pp.1977-1983, 2018. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01892704
Viewpoints using ranking-based argumentation semantics, Proceedings of the 7th International Conference on Computational Models of Argument, vol.2018, pp.11-14, 2018. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01892709
A Structural Benchmark for Logical Argumentation Frameworks, Advances in Intelligent Data Analysis XVI -16th International Symposium, pp.334-346, 2017. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01668017
Existential Rule Languages with Finite Chase: Complexity and Expressiveness, Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, pp.1678-1685, 2015. ,