{"type":"ScholarlyArticle","title":"Splitting Without Backtracking","authors":[{"name":"Alexandre Riazanov","slug":"alexandre-riazanov","given":"Alexandre","family":"Riazanov","affiliation":""},{"name":"Andrei Voronkov","slug":"andrei-voronkov","given":"Andrei","family":"Voronkov","affiliation":""}],"abstract":"Integrating the splitting rule into a saturation-based theorem prover may be highly beneficial for solving certain classes of first-order problems. The use of splitting in the context of saturation-based theorem proving based on explicit case analysis (as implemented in SPASS) employs backtracking which is difficult to implement as it affects design of the whole system. Here we present a “cheap” and efficient technique for implementing splitting that does not use backtracking.","doi":null,"url":"https://ijcai.org/proceedings/2001/85","pdf":"https://ijcai.org/proceedings/2001/0085.pdf","markdown":"https://ijcai.org/proceedings/2001/85.md","bibtex":"https://ijcai.org/proceedings/2001/bibtex/85","volume":{"slug":"2001","title":"Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2001","url":"https://ijcai.org/proceedings/2001/","year":2001,"location":"Seattle, Washington, USA","dates":"","editors":"","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":85,"pages":{"first":611,"last":616},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}