{"type":"ScholarlyArticle","title":"Consequence-Finding Based on Ordered Linear Resolution","authors":[{"name":"Katsumi Inoue","slug":"katsumi-inoue","given":"Katsumi","family":"Inoue","affiliation":""}],"abstract":"Since linear resolution with clause ordering is incomplete for consequence-finding, it has been used mainly for proof-finding. In this paper, we re-evaluate consequence-finding. Firstly, consequence-finding is generalized to the problem in which only interesting clauses having a certain property (called characteristic clauses) should be found . Then, we show how adding a skip rule to ordered linear r es olution makes it complete for consequence-finding in this general sense. Compared with set-of-support resolution, the proposed method generates fewer clauses to find such a subset of consequences. In the propositional case, this is an elegant tool for computing the prime implicants/implicates. The importance of the results lies in their applicability to a wide class of AI problems including procedures for nonmonotonic and abductive reasoning and truth maintenance systems.","doi":null,"url":"https://ijcai.org/proceedings/1991/24","pdf":"https://ijcai.org/proceedings/1991/0024.pdf","markdown":"https://ijcai.org/proceedings/1991/24.md","bibtex":"https://ijcai.org/proceedings/1991/bibtex/24","volume":{"slug":"1991","title":"Proceedings of the Twelfth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1991","url":"https://ijcai.org/proceedings/1991/","year":1991,"location":"Sydney, New South Wales, Australia","dates":"24-30 August 1991","editors":"John Mylopoulos and Ray Reiter","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automated Reasoning","track":"Automated Reasoning","number":24,"pages":{"first":158,"last":163},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}