
Efficient elimination of Skolem functions in firstorder logic without equality
We prove that elimination of a single Skolem function in pure logic incr...
read it

Variable and value elimination in binary constraint satisfaction via forbidden patterns
Variable or value elimination in a constraint satisfaction problem (CSP)...
read it

Variable elimination in binary CSPs
We investigate rules which allow variable elimination in binary CSP (con...
read it

Formalizing Constructive Quantifier Elimination in Agda
In this paper a constructive formalization of quantifier elimination is ...
read it

Covered Clause Elimination
Generalizing the novel clause elimination procedures developed in [M. He...
read it

On characterizing Inclusion of Bayesian Networks
Every directed acyclic graph (DAG) over a finite nonempty set of variab...
read it

A Mixed Graphical Model for Rhythmic Parsing
A method is presented for the rhythmic parsing problem: Given a sequence...
read it
Quantifier Elimination for Statistical Problems
Recent improvement on Tarski's procedure for quantifier elimination in the first order theory of real numbers makes it feasible to solve small instances of the following problems completely automatically: 1. listing all equality and inequality constraints implied by a graphical model with hidden variables. 2. Comparing graphyical models with hidden variables (i.e., model equivalence, inclusion, and overlap). 3. Answering questions about the identification of a model or portion of a model, and about bounds on quantities derived from a model. 4. Determing whether a given set of independence assertions. We discuss the foundation of quantifier elimination and demonstrate its application to these problems.
READ FULL TEXT
Comments
There are no comments yet.