The Use of Max-Sat for Optimal Choice of Automated Theory Repairs. Urbonas, M., Bundy, A., Casanova, J., & Li, X. In Bramer, M. & Ellis, R., editors, Artificial Intelligence XXXVII, pages 49–63, Cham, 2020. Springer International Publishing. abstract bibtex The ABC system repairs faulty Datalog theories using a combination of abduction, belief revision and conceptual change via reformation. Abduction and Belief Revision add/delete axioms or delete/add preconditions to rules, respectively. Reformation repairs them by changing the language of the faulty theory. Unfortunately, the ABC system overproduces repair suggestions. Our aim is to prune these suggestions to leave only a Pareto front of the optimal ones. We apply an algorithm for solving Max-Sat problems, which we call the Partial Max-Sat algorithm, to form this Pareto front.
@InProceedings{urbonas2020,
author="Urbonas, Marius
and Bundy, Alan
and Casanova, Juan
and Li, Xue",
editor="Bramer, Max
and Ellis, Richard",
title="The Use of Max-Sat for Optimal Choice of Automated Theory Repairs",
booktitle="Artificial Intelligence XXXVII",
year="2020",
publisher="Springer International Publishing",
address="Cham",
pages="49--63",
abstract="The ABC system repairs faulty Datalog theories using a combination of abduction, belief revision and conceptual change via reformation. Abduction and Belief Revision add/delete axioms or delete/add preconditions to rules, respectively. Reformation repairs them by changing the language of the faulty theory. Unfortunately, the ABC system overproduces repair suggestions. Our aim is to prune these suggestions to leave only a Pareto front of the optimal ones. We apply an algorithm for solving Max-Sat problems, which we call the Partial Max-Sat algorithm, to form this Pareto front.",
isbn="978-3-030-63799-6"
}
Downloads: 0
{"_id":"d5AZ5cLZwzogyKJTv","bibbaseid":"urbonas-bundy-casanova-li-theuseofmaxsatforoptimalchoiceofautomatedtheoryrepairs-2020","author_short":["Urbonas, M.","Bundy, A.","Casanova, J.","Li, X."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"propositions":[],"lastnames":["Urbonas"],"firstnames":["Marius"],"suffixes":[]},{"propositions":[],"lastnames":["Bundy"],"firstnames":["Alan"],"suffixes":[]},{"propositions":[],"lastnames":["Casanova"],"firstnames":["Juan"],"suffixes":[]},{"propositions":[],"lastnames":["Li"],"firstnames":["Xue"],"suffixes":[]}],"editor":[{"propositions":[],"lastnames":["Bramer"],"firstnames":["Max"],"suffixes":[]},{"propositions":[],"lastnames":["Ellis"],"firstnames":["Richard"],"suffixes":[]}],"title":"The Use of Max-Sat for Optimal Choice of Automated Theory Repairs","booktitle":"Artificial Intelligence XXXVII","year":"2020","publisher":"Springer International Publishing","address":"Cham","pages":"49–63","abstract":"The ABC system repairs faulty Datalog theories using a combination of abduction, belief revision and conceptual change via reformation. Abduction and Belief Revision add/delete axioms or delete/add preconditions to rules, respectively. Reformation repairs them by changing the language of the faulty theory. Unfortunately, the ABC system overproduces repair suggestions. Our aim is to prune these suggestions to leave only a Pareto front of the optimal ones. We apply an algorithm for solving Max-Sat problems, which we call the Partial Max-Sat algorithm, to form this Pareto front.","isbn":"978-3-030-63799-6","bibtex":"@InProceedings{urbonas2020,\nauthor=\"Urbonas, Marius\nand Bundy, Alan\nand Casanova, Juan\nand Li, Xue\",\neditor=\"Bramer, Max\nand Ellis, Richard\",\ntitle=\"The Use of Max-Sat for Optimal Choice of Automated Theory Repairs\",\nbooktitle=\"Artificial Intelligence XXXVII\",\nyear=\"2020\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"49--63\",\nabstract=\"The ABC system repairs faulty Datalog theories using a combination of abduction, belief revision and conceptual change via reformation. Abduction and Belief Revision add/delete axioms or delete/add preconditions to rules, respectively. Reformation repairs them by changing the language of the faulty theory. Unfortunately, the ABC system overproduces repair suggestions. Our aim is to prune these suggestions to leave only a Pareto front of the optimal ones. We apply an algorithm for solving Max-Sat problems, which we call the Partial Max-Sat algorithm, to form this Pareto front.\",\nisbn=\"978-3-030-63799-6\"\n}\n\n","author_short":["Urbonas, M.","Bundy, A.","Casanova, J.","Li, X."],"editor_short":["Bramer, M.","Ellis, R."],"key":"urbonas2020","id":"urbonas2020","bibbaseid":"urbonas-bundy-casanova-li-theuseofmaxsatforoptimalchoiceofautomatedtheoryrepairs-2020","role":"author","urls":{},"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"https://bibbase.org/f/mAv4xsa3qE3YSqF2q/biblio.bib","dataSources":["79oQCSkNzzoZHJw69","SC4vtg3To6xYfQL7G"],"keywords":[],"search_terms":["use","max","sat","optimal","choice","automated","theory","repairs","urbonas","bundy","casanova","li"],"title":"The Use of Max-Sat for Optimal Choice of Automated Theory Repairs","year":2020}