• Publications
  • Influence
PSATO: a Distributed Propositional Prover and its Application to Quasigroup Problems
TLDR
We present a distributed/parallel prover for propositional satisfiability (SAT), called PSATO, for networks of workstations. Expand
  • 242
  • 26
  • PDF
New results on rewrite-based satisfiability procedures
TLDR
We prove termination of a rewrite-based first-order engine on the theories of records, integer offsets,integer offsets modulo and lists. Expand
  • 102
  • 9
  • PDF
Automated Reasoning
  • 66
  • 9
  • PDF
A taxonomy of parallel strategies for deduction
  • M. Bonacina
  • Mathematics, Computer Science
  • Annals of Mathematics and Artificial Intelligence
  • 10 January 2001
TLDR
This paper presents a taxonomy of parallel theorem-proving methods based on the control of search (e.g., fine, medium and coarse grain) and the nature of the method. Expand
  • 42
  • 4
  • PDF
Theory decision by decomposition
TLDR
We propose an approach that decomposes the formula in such a way that its definitional part, including the theory, can be compiled by a rewrite-based first-order theorem prover, and the residual problem can be decided by an SMT-solver, based on the Davis-Putnam-Logemann-Loveland procedure. Expand
  • 21
  • 3
  • PDF
On Interpolation in Automated Theorem Proving
TLDR
We present a two-stage approach that works by tracking literals, computes a provisional interpolant, which may contain non- shared symbols, and applies lifting to replace non-shared constants by quantified variables. Expand
  • 19
  • 3
  • PDF
Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures
TLDR
In the context of combinations of theories with disjoint signatures, we classify the component theories according to the decidability of constraint satisfiability problems in arbitrary and in infinite models, respectively. Expand
  • 56
  • 2
  • PDF
Abstract canonical inference
TLDR
An abstract framework of canonical inference is used to explore how different proof orderings induce different variants of saturation and completeness. Expand
  • 31
  • 2
  • PDF
On Variable-inactivity and Polynomial tau-Satisfiability Procedures
TLDR
In this article, we generalize the rewrite-based approach from deciding the satisfiability of sets of ground literals to deciding that of arbitrary ground formulae in the theory. Expand
  • 26
  • 2
  • PDF
On Rewrite Programs: Semantics and Relationship with Prolog
TLDR
We present a precise operational semantics for rewrite programs, define their denotational (fixpoint) semantics, and clarify the relationships between rewrite programs and Prolog. Expand
  • 26
  • 2
  • PDF
...
1
2
3
4
5
...