{"type":"ScholarlyArticle","title":"Path Resolution with Link Deletion","authors":[{"name":"Neil V. Murray","slug":"neil-v-murray","given":"Neil V.","family":"Murray","affiliation":""},{"name":"Erik Rosenthal","slug":"erik-rosenthal","given":"Erik","family":"Rosenthal","affiliation":""}],"abstract":"We introduce a graphical representation of quantifier-free predicate calculus formulas and a new rule of inference which employs this representation . The new rule is an amalgamation of resolution and Prawitz analysis which we call path resolution. Path resolution allows Prawitz analysis of an arbitrary subgraph of the graph representing a formula. If such a subgraph is not !arge enough to demoostrate a contradiction, a path resolvent of the subgraph may be generated with respect to the entire graph. This generalizes the notions of !arge inference present in hyperresolution, clash-resolution, NC-resolution, and ULresolution. Two forms of path resolution are described for which deletion of the links resolved upon preserves the spanning propcrty .","doi":null,"url":"https://ijcai.org/proceedings/1985/241","pdf":"https://ijcai.org/proceedings/1985/0241.pdf","markdown":"https://ijcai.org/proceedings/1985/241.md","bibtex":"https://ijcai.org/proceedings/1985/bibtex/241","volume":{"slug":"1985","title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1985","url":"https://ijcai.org/proceedings/1985/","year":1985,"location":"Los Angeles, California, USA","dates":"","editors":"Aravind Joshi","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Theorem Proving","track":"Theorem Proving","number":241,"pages":{"first":1187,"last":1192},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}