We present GDPLL, a generalization of the DPLL procedure. It solves the satisfiability problem for decidable fragments of quantifier-free first-order logic.

We present GDPLL, a generalization of the DPLL procedure. It solves the satisfiability problem for decidable fragments of quantifier-free first-order logic.

Jan 1, 2004 · For the logic of equality and uninterpreted function symbols, one can use Ackermann's reduction [Ack54,BGV99] to eliminate the function symbols.

This work characterises dpllt as an abstract interpretation algorithm that computes a product of two abstractions and shows theoretically that the split ...

We present GDPLL, a generalization of the DPLL procedure. It solves the satisfiability problem for decidable fragments of quantifier-free first-order logic.

We present GDPLL, a generalization of the DPLL procedure. It solves the satisfiability problem for decidable fragments of quantifier-free first-order logic.

We present GDPLL, a generalization of the DPLL procedure. It solves the satisfiability problem for decidable fragments of quantifier-free first-order logic.

We present GDPLL, a generalization of the DPLL procedure. It solves the satisfiability problem for decidable fragments of quantifier-free first-order logic.

We propose a specification language for the formalization of data types with partial or non-terminating operations as part of a rewrite-based framework for ...

We present GDPLL, a generalization of the DPLL procedure. It solves the satisfiability problem for decidable fragments of quantifier-free first-order logic.