{"type":"ScholarlyArticle","title":"A Note on Backward Dual Resolution and Its Application to Proving Completeness of Rule-Based Systems","authors":[{"name":"Antoni Ligeza","slug":"antoni-ligeza","given":"Antoni","family":"Ligeza","affiliation":""}],"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-resolution, 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 rulebased 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.","doi":null,"url":"https://ijcai.org/proceedings/1993/19","pdf":"https://ijcai.org/proceedings/1993/0019.pdf","markdown":"https://ijcai.org/proceedings/1993/19.md","bibtex":"https://ijcai.org/proceedings/1993/bibtex/19","volume":{"slug":"1993","title":"Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1993","url":"https://ijcai.org/proceedings/1993/","year":1993,"location":"Chambéry, France","dates":"","editors":"Ruzena Bajcsy","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automated Reasoning","track":"Automated Reasoning","number":19,"pages":{"first":132,"last":136},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}