This paper is centered on the family of Dung’s finite argumentation frameworks when the attacks relation is symmetric (and nonempty and irreflexive). We show that while this fa...
Sylvie Coste-Marquis, Caroline Devred, Pierre Marq...
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
Nadia Creignou, Johannes Schmidt, Michael Thomas, ...
Resolving the semantic heterogeneity problem is crucial to allow interoperability between ontology-based systems. Ontology matching based on argumentation is an innovative research...
An architecture is described for designing systems that acquire and manipulate large amounts of unsystematized, or so-called commonsense, knowledge. Its aim is to exploit to the fu...
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...