4978 search results - page 209 / 996 » Logical models of argument |
134
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
114
click to vote
ICLP
1990
Springer
15 years 8 months ago
1990
Springer
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
104
click to vote
SYNTHESE
2008
15 years 4 months ago
2008
While considerable ink has been spilt over the rejection of idealism by Bertrand Russell and G.E. Moore at the end of the 19th Century, relatively little attention has been directe...
137
click to vote
JLP
2007
15 years 4 months ago
2007
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
142
click to vote
PROVSEC
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Oracle separation methods are used in cryptography to rule out blackbox reductions between cryptographic primitives. It is sufficient to find an oracle relative to whic...