A note on backward dual resolution and its application to proving completeness of rule-based systems

Authors:
Antoni Ligeza
Affiliations:
Institute of Automatics AGH, Krakow, Poland
Venue:
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Year:
1993

Citing 5
Cited 1

Logical foundations of artificial intelligence

Logical foundations of artificial intelligence
A decision-table-used processor for checking completeness and consistency in rule-based expert systems

International Journal of Man-Machine Studies
Integrated knowledge-based system design and validation for solving problems in uncertain environments

International Journal of Man-Machine Studies - Special issue: symbolic problem solving in noisy and novel task environments
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving

Tab-Trees: A CASE Tool for the Design of Extended Tabular Systems

DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a method of theorem proving dual to resolution method is presented in brief. The investigated method is called backward dual resolution or bd-re solution, for short. The main idea of bd-resolution consists in proving validity of a formula in disjunctive normal form, by generating an empty tautology formula from it; it is shown that the initial formula is a logical consequence of the obtained tautology. An idea of the theorem proving method is outlined, and its application to checking completeness of rule-based systems is investigated. A formal definition of completeness and specific completeness are stated and an algorithm for completeness verification is proposed. Moreover, a generalized bd-resolution aimed at proving completeness under intended interpretation is defined.