New methods for computing inferences in first order logic | Zendy

J. N. Hooker | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

New methods for computing inferences in first order logic

Author(s) -

J. N. Hooker

Publication year - 1993

Publication title -

annals of operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.068

H-Index - 105

eISSN - 1572-9338

pISSN - 0254-5330

DOI - 10.1007/bf02027814

Subject(s) - datalog , decidability , fragment (logic) , satisfiability , computer science , first order logic , theory of computation , hypergraph , predicate logic , dynamic logic (digital electronics) , theoretical computer science , description logic , algorithm , programming language , mathematics , discrete mathematics , physics , transistor , voltage , quantum mechanics

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).

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research