Sciweavers

662 search results - page 21 / 133
» Formalizing Basic First Order Model Theory
Sort
View
DAC
2001
ACM
14 years 8 months ago
Formal Property Verification by Abstraction Refinement with Formal, Simulation and Hybrid Engines
roperty Verification by Abstraction Refinement with Formal, Simulation and Hybrid Engines Dong Wang , Pei-Hsin Ho , Jiang Long , James Kukula Yunshan Zhu , Tony Ma , Robert D...
Dong Wang, Pei-Hsin Ho, Jiang Long, James H. Kukul...
AML
2005
53views more  AML 2005»
13 years 7 months ago
Models of set theory with definable ordinals
A DO model (here also referred to a Paris model) is a model M of set theory all of whose ordinals are first order definable in M. Jeffrey Paris (1973) initiated the study of DO mo...
Ali Enayat
ENTCS
2007
126views more  ENTCS 2007»
13 years 7 months ago
Modelling Calculi with Name Mobility using Graphs with Equivalences
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
Paolo Baldan, Fabio Gadducci, Ugo Montanari
JAC
2008
13 years 9 months ago
Tilings and model theory
In this paper we emphasize the links between model theory and tilings. More precisely, after giving the definitions of what tilings are, we give a natural way to have an interpreta...
Alexis Ballier, Emmanuel Jeandel
FUIN
2007
121views more  FUIN 2007»
13 years 7 months ago
A Possibility-Theoretic View of Formal Concept Analysis
Abstract. The paper starts from the standard relational view linking objects and properties in formal concept analysis, here augmented with four modal-style operators (known as suf...
Didier Dubois, Florence Dupin de Saint-Cyr, Henri ...