1912 search results - page 156 / 383 » On the evaluation of argumentation formalisms |
204
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
Inferring an appropriate DTD or XML Schema Definition (XSD) for a given collection of XML documents essentially reduces to learning deterministic regular expressions from sets of ...
165
click to vote
CADE
2001
Springer
16 years 6 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
183
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Knowledge extraction is a fundamental notion, modeling machine possession of values (witnesses) in a computational complexity sense and enabling one to argue about the internal st...
186
click to vote
SAC
2010
ACM
15 years 4 months ago
2010
ACM
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...
226
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Coecke, Sadrzadeh, and Clark [3] developed a compositional model of meaning for distributional semantics, in which each word in a sentence has a meaning vector and the distributio...