Sciweavers

1948 search results - page 176 / 390
» Formalizing Mirror Theory
Sort
View
EACL
1993
ACL Anthology
15 years 7 months ago
Resolving Zero Anaphora in Japanese
The paper presents a computational theory for resolving Japanese zero anaphora, based on the notion of discourse segment. We see that the discourse segment reduces the domain of a...
Tadashi Nomoto, Yoshihiko Nitta
COGSCI
2008
72views more  COGSCI 2008»
15 years 6 months ago
The Tractable Cognition Thesis
The recognition that human minds/brains are finite systems with limited resources for computation has led some researchers to advance the Tractable Cognition thesis: Human cogniti...
Iris van Rooij
JIIS
2006
93views more  JIIS 2006»
15 years 6 months ago
Measuring inconsistency in knowledgebases
It is well-known that knowledgebases may contain inconsistencies. We provide a measure to quantify the inconsistency of a knowledgebase, thereby allowing for the comparison of the...
John Grant, Anthony Hunter
LISP
2006
105views more  LISP 2006»
15 years 6 months ago
Call-by-push-value: Decomposing call-by-value and call-by-name
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...
Paul Blain Levy
APAL
2004
105views more  APAL 2004»
15 years 6 months ago
Dual weak pigeonhole principle, Boolean complexity, and derandomization
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
Emil Jerábek