Sciweavers

491 search results - page 6 / 99
» Linear Quantifier Elimination
Sort
View
ESOP
2008
Springer
14 years 11 months ago
Cover Algorithms and Their Combination
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
Sumit Gulwani, Madan Musuvathi
78
Voted
AUTOMATICA
2002
72views more  AUTOMATICA 2002»
14 years 9 months ago
Quantifying the accuracy of Hammerstein model estimation
: This paper investigates the accuracy of the linear model estimate that forms a part of an overall Hammerstein model structure. A key finding here is that the process of estimatin...
Brett Ninness, Stuart Gibson
94
Voted
IJCAI
2001
14 years 11 months ago
Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
Patrick Doherty, Witold Lukaszewicz, Andrzej Szala...
CORR
2010
Springer
173views Education» more  CORR 2010»
14 years 9 months ago
Automatic Modular Abstractions for Template Numerical Constraints
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
David Monniaux