Sciweavers

295 search results - page 5 / 59
» Approximating the Expressive Power of Logics in Finite Model...
Sort
View
CORR
2006
Springer
135views Education» more  CORR 2006»
13 years 7 months ago
Constraint Functional Logic Programming over Finite Domains
In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP(FD) ) with a lazy functional logic programming language which seamlessl...
Antonio J. Fernández, Maria Teresa Hortal&a...
TCS
2002
13 years 7 months ago
Monadic second-order logic on tree-like structures
An operation M which constructs from a given structure M a tree-like structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata r...
Igor Walukiewicz
BIRTHDAY
1997
Springer
13 years 11 months ago
Expressive Power of Unary Counters
We compare the expressive power on finite models of two extensions of first order logic L with equality. L(Ct) is formed by adding an operator count{x : ϕ}, which builds a term ...
Michael Benedikt, H. Jerome Keisler
ISCAS
2007
IEEE
179views Hardware» more  ISCAS 2007»
14 years 1 months ago
Analysis for Signal and Power Integrity Using the Multilayered Finite Difference Method
— We present a method for fast analysis of signal and power integrity based on a recently developed multilayered finite difference method (M-FDM). In order to accurately model m...
Ege Engin, Krishna Bharath, Madhavan Swaminathan
ACL
1997
13 years 8 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans