Sciweavers

119 search results - page 9 / 24
» Tree-Width for First Order Formulae
Sort
View
ADCM
2004
58views more  ADCM 2004»
13 years 7 months ago
Classification of Bivariate Configurations with Simple Lagrange Interpolation Formulae
In 1977 Chung and Yao introduced a geometric characterization in multivariate interpolation in order to identify distributions of points such that the Lagrange functions are produc...
Jesús M. Carnicer, Mariano Gasca
COCOON
1995
Springer
13 years 10 months ago
Constructing Craig Interpolation Formulas
A Craig interpolant of two inconsistent theories is a formula which is true in one and false in the other. This paper gives an eificient method for constructing a Craig interpolant...
Guoxiang Huang
AISC
2010
Springer
13 years 10 months ago
A Formal Quantifier Elimination for Algebraically Closed Fields
We prove formally that the first order theory of algebraically closed fields enjoy quantifier elimination, and hence is decidable. This proof is organized in two modular parts. We ...
Cyril Cohen, Assia Mahboubi
CAV
2009
Springer
163views Hardware» more  CAV 2009»
14 years 7 months ago
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
Quantifier reasoning in Satisfiability Modulo Theories (SMT) is a long-standing challenge. The practical method employed in modern SMT solvers is to instantiate quantified formulas...
Leonardo Mendonça de Moura, Yeting Ge
ECAI
2004
Springer
13 years 11 months ago
Encoding Quantified CSPs as Quantified Boolean Formulae
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...