Sciweavers

491 search results - page 16 / 99
» Linear Quantifier Elimination
Sort
View
AML
2006
103views more  AML 2006»
13 years 7 months ago
Decision methods for linearly ordered Heyting algebras
Abstract. The decision problem for positively quantified formulae in the theory of linearly ordered Heyting algebras is known, as a special case of work of Kreisel, to be solvable;...
Roy Dyckhoff, Sara Negri
IPPS
1998
IEEE
13 years 11 months ago
On the Automatic Validation of Parameterized Unity Programs
We study the automation of the verification of Unity programs with infinite or parameterized state space. This paper presents methods allowing the transformation of some second-ord...
Jean-Paul Bodeveix, Mamoun Filali
JSYML
2000
103views more  JSYML 2000»
13 years 7 months ago
A Model Complete Theory of Valued D-Fields
The notion of a D-ring, generalizing that of a differential or a difference ring, is introduced. Quantifier elimination and a version of the AxKochen-Ershov principle is proven for...
Thomas Scanlon
CDC
2009
IEEE
147views Control Systems» more  CDC 2009»
13 years 5 months ago
A Distributed Hybrid Filter for target tracking in sensor networks
In this paper, we propose the Distributed Hybrid Filter (DHF) to overcome the performance degradation in Sigma Point Filters caused by bad linearization. A quantifiable criterion t...
Feng Li, Jamie S. Evans
TCS
2011
13 years 2 months ago
A semantic measure of the execution time in linear logic
We give a semantic account of the execution time (i.e. the number of cut elimination steps leading to the normal form) of an untyped MELL net. We first prove that: 1) a net is he...
Daniel de Carvalho, Michele Pagani, Lorenzo Tortor...