Sciweavers

2214 search results - page 259 / 443
» Complexity of Reasoning
Sort
View
133
Voted
TSE
2008
97views more  TSE 2008»
15 years 3 months ago
Timed Automata Patterns
Timed Automata have proven to be useful for specification and verification of real-time systems. System design using Timed Automata relies on explicit manipulation of clock variabl...
Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun 00...
122
Voted
AI
2002
Springer
15 years 3 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
JELIA
2010
Springer
15 years 2 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, ...
148
Voted
CORR
2010
Springer
111views Education» more  CORR 2010»
15 years 1 months ago
Analysis Of Cancer Omics Data In A Semantic Web Framework
Our work concerns the elucidation of the cancer (epi)genome, transcriptome and proteome to better understand the complex interplay between a cancer cell's molecular state and ...
Matthew Holford, James P. McCusker, Kei-Hoi Cheung...
157
Voted
JMLR
2010
192views more  JMLR 2010»
14 years 10 months ago
Inducing Tree-Substitution Grammars
Inducing a grammar from text has proven to be a notoriously challenging learning task despite decades of research. The primary reason for its difficulty is that in order to induce...
Trevor Cohn, Phil Blunsom, Sharon Goldwater