Sciweavers

29 search results - page 4 / 6
» Tractability in Value-based Argumentation
Sort
View
ECSQARU
2005
Springer
14 years 2 months ago
Symmetric Argumentation Frameworks
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...
JELIA
2010
Springer
13 years 7 months ago
Sets of Boolean Connectives That Make Argumentation Easier
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, ...
ARGMAS
2009
Springer
14 years 3 months ago
Comparing Argumentation Frameworks for Composite Ontology Matching
Resolving the semantic heterogeneity problem is crucial to allow interoperability between ontology-based systems. Ontology matching based on argumentation is an innovative research...
Cássia Trojahn dos Santos, Paulo Quaresma, ...
ICALP
1998
Springer
14 years 4 days ago
A Neuroidal Architecture for Cognitive Computation
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...
Leslie G. Valiant
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
13 years 7 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
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...