Sciweavers

37 search results - page 4 / 8
» Preservation Theorems in Finite Model Theory
Sort
View
KBSE
1999
IEEE
13 years 11 months ago
Modular and Incremental Analysis of Concurrent Software Systems
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
Hassen Saïdi
CADE
2002
Springer
14 years 7 months ago
Reasoning by Symmetry and Function Ordering in Finite Model Generation
Abstract. Finite model search for first-order logic theories is complementary to theorem proving. Systems like Falcon, SEM and FMSET use the known LNH (Least Number Heuristic) heur...
Gilles Audemard, Belaid Benhamou
JSYML
2008
66views more  JSYML 2008»
13 years 7 months ago
Special groups whose isometry relation is a finite union of cosets
0-stable 0-categorical linked quaternionic mappings are studied and are shown to correspond (in some sense) to special groups which are 0stable, 0-categorical, satisfy AP(3) and ha...
Vincent Astier
LICS
2005
IEEE
14 years 1 months ago
Modal Characterisation Theorems over Special Classes of Frames
We investigate model theoretic characterisations of the expressive power of modal logics in terms of bisimulation invariance. The paradigmatic result of this kind is van Benthemâ€...
Anuj Dawar, Martin Otto
CORR
2008
Springer
151views Education» more  CORR 2008»
13 years 7 months ago
Checking the Quality of Clinical Guidelines using Automated Reasoning Tools
Requirements about the quality of clinical guidelines can be represented by schemata borrowed from the theory of abductive diagnosis, using temporal logic to model the time-orient...
Arjen Hommersom, Peter J. F. Lucas, Patrick van Bo...