Sciweavers

1650 search results - page 223 / 330
» The HOM problem is decidable
Sort
View
AI
2002
Springer
15 years 6 months ago
Coherence in finite argument systems
Systems provide a rich abstraction within which divers concepts of reasoning, acceptability and defeasibility of arguments, etc., may be studied using a unified framework. Two imp...
Paul E. Dunne, Trevor J. M. Bench-Capon
COMCOM
1999
78views more  COMCOM 1999»
15 years 6 months ago
A complete test sequence using cyclic sequence for conformance testing
We present a problem of commonly used characterization sequences (CS) for the protocol conformance testing and propose a new test sequence to resolve the problem. The proposed tes...
DaeHun Nyang, S. Y. Lim, JooSeok Song
IJAR
2010
91views more  IJAR 2010»
15 years 4 months ago
Logical and algorithmic properties of stable conditional independence
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
Mathias Niepert, Dirk Van Gucht, Marc Gyssens
JELIA
2010
Springer
15 years 4 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, ...
PVLDB
2010
119views more  PVLDB 2010»
15 years 4 months ago
Chase Termination: A Constraints Rewriting Approach
Several database areas such as data exchange and integration share the problem of fixing database instance violations with respect to a set of constraints. The chase algorithm so...
Francesca Spezzano, Sergio Greco