903 search results - page 2 / 181 » Non-well-founded trees in categories |
JOLLI
2010
13 years 4 months ago
2010
rder Abstract Categorial Grammars as Hyperedge Replacement Grammars Makoto Kanazawa National Institute of Informatics 2–1–2 Hitotsubashi, Chiyoda-ku, Tokyo, 101–8430, Japan A...
CORR
2006
Springer
13 years 6 months ago
2006
Springer
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
DAS
2010
Springer
13 years 9 months ago
2010
Springer
We describe a component of a document analysis system for constructing ontologies for domain-specific web tables imported into Excel. This component automates extraction of the Wa...
EMNLP
2010
13 years 4 months ago
2010
We examine effects that empty categories have on machine translation. Empty categories are elements in parse trees that lack corresponding overt surface forms (words) such as drop...
LICS
2012
IEEE
11 years 8 months ago
2012
IEEE
—Interactive theorem provers based on higher-order logic (HOL) traditionally follow the definitional approach, reducing high-level specifications to logical primitives. This al...