Date of Original Version

4-1992

Type

Article

Abstract or Description

Recent improvements in satisfiability algorithms for propositional logic have made partial instantiation methods for first order predicate logic computationally more attractive. Two such methods have been proposed, one by Jeroslow and a hypergraph method for datalog formulas by Gallo and Rago. We show that they are instances of two general approaches to partial instantiation, and we develop these approaches for a large decidable fragment of first order logic (the ∃∀ fragment).

DOI

10.1007/BF02027814

Share

COinS
 

Published In

Annals of Operations Research, 447-492.