A resolution rule for well-formed formulae

A resolution proof procedure that operates on well-formed formulae with all quantifiers in place is presented. Extension of the unification algorithm ρ Q-unification (i.e. with quantifiers in place) is also discussed. The procedure involves a single inference rule called WFF-resolution which is prov...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 81; no. 2; pp. 223 - 235
Main Authors Bhatta, K.S.H.S.R., Karnick, Harish
Format Journal Article Conference Proceeding
LanguageEnglish
Published Amsterdam Elsevier B.V 30.04.1991
Elsevier
Subjects
Applied sciences
Artificial intelligence
Computer science; control theory; systems
Exact sciences and technology
Problem solving, game playing
Automatic proving
Theorem proving
Algorithm
Artificial intelligence
Inference rule
Unification
Online AccessGet full text

Cover

More Information
Summary:A resolution proof procedure that operates on well-formed formulae with all quantifiers in place is presented. Extension of the unification algorithm ρ Q-unification (i.e. with quantifiers in place) is also discussed. The procedure involves a single inference rule called WFF-resolution which is proved to be sound and complete.
ISSN:0304-3975
1879-2294
DOI:10.1016/0304-3975(91)90192-5