{"type":"ScholarlyArticle","title":"Efficient Consequence Finding","authors":[{"name":"Laurent Simon","slug":"laurent-simon","given":"Laurent","family":"Simon","affiliation":""},{"name":"Alvaro del Val","slug":"alvaro-del-val","given":"Alvaro","family":"del Val","affiliation":""}],"abstract":"We present an extensive experimental study of consequence-finding algorithms based on kernel resolution, using both a trie-based and a novel ZBDD-based implementation, which uses ZeroSuppressed Binary Decision Diagrams to concisely store and process very large clause sets. Our study considers both the full prime implicate task and applications of consequence-finding for restricted target languages in abduction, model-based and faulttree diagnosis, and polynomially-bounded knowledge compilation. We show that the ZBDD implementation can push consequence-finding to a new limit, solving problems which generate over 1070 clauses.","doi":null,"url":"https://ijcai.org/proceedings/2001/51","pdf":"https://ijcai.org/proceedings/2001/0051.pdf","markdown":"https://ijcai.org/proceedings/2001/51.md","bibtex":"https://ijcai.org/proceedings/2001/bibtex/51","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":51,"pages":{"first":359,"last":369},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}