Sciweavers

37 search results - page 2 / 8
» Preservation Theorems in Finite Model Theory
Sort
View
ATVA
2008
Springer
143views Hardware» more  ATVA 2008»
13 years 7 months ago
Automating Algebraic Specifications of Non-freely Generated Data Types
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif
JSYML
2010
120views more  JSYML 2010»
13 years 4 days ago
First order properties on nowhere dense structures
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
Jaroslav Nesetril, Patrice Ossona de Mendez
HYBRID
1997
Springer
13 years 9 months ago
Hybrid Systems with Finite Bisimulations
Abstract. The theory of formal verification is one of the main approaches to hybrid system analysis. Decidability questions for verification algorithms are obtained by constructi...
Gerardo Lafferriere, George J. Pappas, Shankar Sas...
MICCAI
2005
Springer
14 years 6 months ago
Mass Preserving Registration for Heart MR Images
Abstract. This paper presents a new algorithm for non-rigid registration between two doubly-connected regions. Our algorithm is based on harmonic analysis and the theory of optimal...
Lei Zhu, Steven Haker, Allen Tannenbaum
BSL
2005
106views more  BSL 2005»
13 years 5 months ago
Compactness and independence in non first order frameworks
This communication deals with positive model theory, a non first order model theoretic setting which preserves compactness at the cost of giving up negation. Positive model theory ...
Itay Ben-Yaacov