## The Satisfiability problem for the Schöenfinkel-Bernays fragment: Partial Instantiation and Hypergraph Algorithms (1994)

Venue: | Proceedings of 8th subcommission "Magnetic |

Citations: | 4 - 2 self |

### BibTeX

@TECHREPORT{Gallo94thesatisfiability,

author = {Giorgio Gallo and Gabriella Rago},

title = {The Satisfiability problem for the Schöenfinkel-Bernays fragment: Partial Instantiation and Hypergraph Algorithms},

institution = {Proceedings of 8th subcommission "Magnetic},

year = {1994}

}

### OpenURL

### Abstract

A partial instantiation approach to the solution of the satisfiability problem in the Schoenfinkel-Bernays fragment of 1 st order logic is presented. It is based on a reduction of the problem to a finite sequence of satisfiability problems in the propositional logic and it improves upon the original idea of partial instantiation, as proposed by Jeroslow. In the second part of the paper a new interpretation of the partial instantiation approach in terms of Directed Hypergraphs is proposed and a particular implementation for the Datalog case is described in detail. 1 Introduction. The problem of Logical Inference plays a fundamental role in Decision Sciences and has several applications in fields such as decision support systems, logic circuit design, data bases, and programming languages. Although classical approaches to formalize and solve inference problems have been of symbolic nature, in the last few years many scientists in the Operations Research community have studied ...