Sciweavers

3319 search results - page 188 / 664
» Subshifts, Languages and Logic
Sort
View
AML
2010
118views more  AML 2010»
15 years 6 months ago
The modal logic of continuous functions on the rational numbers
Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'. We ext...
Philip Kremer
AML
2006
87views more  AML 2006»
15 years 6 months ago
The modal logic of continuous functions on cantor space
Abstract Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'...
Philip Kremer
RCC
2002
104views more  RCC 2002»
15 years 6 months ago
Architectural Specification, Exploration and Simulation Through Rewriting-Logic
In recent years Arvind's Group at MIT has shown the usefulness of term rewriting theory for the specification of processor architectures. In their approach processors specifi...
Mauricio Ayala-Rincón, Reiner W. Hartenstei...
CORR
2004
Springer
85views Education» more  CORR 2004»
15 years 6 months ago
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
Patricia M. Hill, Enea Zaffanella, Roberto Bagnara
CORR
2011
Springer
199views Education» more  CORR 2011»
15 years 1 months ago
From Machine Learning to Machine Reasoning
A plausible definition of "reasoning" could be "algebraically manipulating previously acquired knowledge in order to answer a new question". This definition co...
Léon Bottou