Sciweavers

3385 search results - page 349 / 677
» Language, Logic, and the Brain
Sort
View
ENTCS
2006
171views more  ENTCS 2006»
15 years 6 months ago
Program Extraction From Proofs of Weak Head Normalization
We formalize two proofs of weak head normalization for the simply typed lambdacalculus in first-order minimal logic: one for normal-order reduction, and one for applicative-order ...
Malgorzata Biernacka, Olivier Danvy, Kristian St&o...
ENTCS
2002
103views more  ENTCS 2002»
15 years 6 months ago
Deciding low levels of tree-automata hierarchy
The paper discusses the hierarchy of indices of finite automata over infinite objects. This hierarchy corresponds exactly to the hierarchy of alternations of least and greatest fi...
Igor Walukiewicz
JAIR
2002
134views more  JAIR 2002»
15 years 6 months ago
Specific-to-General Learning for Temporal Events with Application to Learning Event Definitions from Video
We develop, analyze, and evaluate a novel, supervised, specific-to-general learner for a simple temporal logic and use the resulting algorithm to learn visual event definitions fr...
Alan Fern, Robert Givan, Jeffrey Mark Siskind
IFM
2009
Springer
183views Formal Methods» more  IFM 2009»
15 years 4 months ago
Challenges in the Specification of Full Contracts
Abstract. The complete specification of full contracts -- contracts which include tolerated exceptions, and which enable reasoning about the contracts themselves, can be achieved u...
Gordon J. Pace, Gerardo Schneider
FUIN
2010
98views more  FUIN 2010»
15 years 4 months ago
On the Borel Complexity of MSO Definable Sets of Branches
An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow ...
Mikolaj Bojanczyk, Damian Niwinski, Alexander Rabi...