250 search results - page 33 / 50 » Reflections on Finite Model Theory |
88
Voted
JCSS
2008
14 years 9 months ago
2008
We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context...
MLQ
2006
14 years 9 months ago
2006
We define the concept of a logic frame, which extends the concept stract logic by adding the concept of a syntax and an axiom system. In a recursive logic frame the syntax and the...
89
Voted
EMSOFT
2006
Springer
15 years 1 months ago
2006
Springer
We report on a case study in which the model checker Uppaal is used to formally model parts of Zeroconf, a protocol for dynamic configuration of IPv4 link-local addresses that has...
101
click to vote
AUTOMATICA
2008
14 years 9 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
111
click to vote
IFIP
2010
Springer
14 years 4 months ago
2010
Springer
This paper formalizes the semantics of trust and studies the transitivity of trust. On the Web, people and software agents have to interact with "strangers". This makes ...