Sciweavers

1912 search results - page 94 / 383
» On the evaluation of argumentation formalisms
Sort
View
JSC
2006
102views more  JSC 2006»
15 years 6 months ago
Counterexamples to witness conjectures
Consider the class of exp-log constants, which is constructed from the integers using the field operations, exponentiation and logarithm. Let z be such an exp-log constant and let...
Joris van der Hoeven
CORR
2010
Springer
186views Education» more  CORR 2010»
15 years 4 months ago
A PDTB-Styled End-to-End Discourse Parser
We have developed a full discourse parser in the Penn Discourse Treebank (PDTB) style. Our trained parser first identifies all discourse and non-discourse relations, locates and...
Ziheng Lin, Hwee Tou Ng, Min-Yen Kan
CORR
2011
Springer
148views Education» more  CORR 2011»
14 years 10 months ago
Repetitive Reduction Patterns in Lambda Calculus with letrec (Work in Progress)
extended abstract we report on work in progress carried out within the framework of the NWO project Realising Optimal Sharing. Instead of discussing optimal reduction in the λ-cal...
Jan Rochel, Clemens Grabmayer
ACL
2012
13 years 8 months ago
Sentence Compression with Semantic Role Constraints
For sentence compression, we propose new semantic constraints to directly capture the relations between a predicate and its arguments, whereas the existing approaches have focused...
Katsumasa Yoshikawa, Ryu Iida, Tsutomu Hirao, Mana...
RSP
1998
IEEE
126views Control Systems» more  RSP 1998»
15 years 10 months ago
Testing Prototypes Validity to Enhance Code Reuse
The complexity of distributed systems is a problem when designers want to evaluate their safety and liveness. Often, they are built by integration of existing components with newl...
Didier Buchs, A. Diagne, Fabrice Kordon