Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets. Bacchus, F. & Katsirelos, G. In Computer Aided Verification - 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part II, pages 70–86, 2015.
Paper doi bibtex @InProceedings{DBLP:conf/cav/BacchusK15,
Title = {Using Minimal Correction Sets to More Efficiently Compute Minimal
Unsatisfiable Sets},
Author = {Fahiem Bacchus and
George Katsirelos},
Booktitle = {Computer Aided Verification - 27th International Conference, {CAV}
2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part
{II}},
Year = {2015},
Pages = {70--86},
Bibsource = {dblp computer science bibliography, https://dblp.org},
Biburl = {https://dblp.org/rec/bib/conf/cav/BacchusK15},
Doi = {10.1007/978-3-319-21668-3\_5},
Timestamp = {Thu, 25 May 2017 01:00:00 +0200},
Url = {https://doi.org/10.1007/978-3-319-21668-3\_5}
}
Downloads: 0
{"_id":"ZEh7cWgSS82c9jne8","bibbaseid":"bacchus-katsirelos-usingminimalcorrectionsetstomoreefficientlycomputeminimalunsatisfiablesets-2015","downloads":0,"creationDate":"2018-09-20T19:33:15.617Z","title":"Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets","author_short":["Bacchus, F.","Katsirelos, G."],"year":2015,"bibtype":"inproceedings","biburl":"http://www.cs.toronto.edu/kr/publications/list.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets","author":[{"firstnames":["Fahiem"],"propositions":[],"lastnames":["Bacchus"],"suffixes":[]},{"firstnames":["George"],"propositions":[],"lastnames":["Katsirelos"],"suffixes":[]}],"booktitle":"Computer Aided Verification - 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part II","year":"2015","pages":"70–86","bibsource":"dblp computer science bibliography, https://dblp.org","biburl":"https://dblp.org/rec/bib/conf/cav/BacchusK15","doi":"10.1007/978-3-319-21668-3_5","timestamp":"Thu, 25 May 2017 01:00:00 +0200","url":"https://doi.org/10.1007/978-3-319-21668-3\\_5","bibtex":"@InProceedings{DBLP:conf/cav/BacchusK15,\n Title = {Using Minimal Correction Sets to More Efficiently Compute Minimal\n Unsatisfiable Sets},\n Author = {Fahiem Bacchus and\n George Katsirelos},\n Booktitle = {Computer Aided Verification - 27th International Conference, {CAV}\n 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part\n {II}},\n Year = {2015},\n Pages = {70--86},\n\n Bibsource = {dblp computer science bibliography, https://dblp.org},\n Biburl = {https://dblp.org/rec/bib/conf/cav/BacchusK15},\n Doi = {10.1007/978-3-319-21668-3\\_5},\n Timestamp = {Thu, 25 May 2017 01:00:00 +0200},\n Url = {https://doi.org/10.1007/978-3-319-21668-3\\_5}\n}\n\n","author_short":["Bacchus, F.","Katsirelos, G."],"key":"DBLP:conf/cav/BacchusK15","id":"DBLP:conf/cav/BacchusK15","bibbaseid":"bacchus-katsirelos-usingminimalcorrectionsetstomoreefficientlycomputeminimalunsatisfiablesets-2015","role":"author","urls":{"Paper":"https://doi.org/10.1007/978-3-319-21668-3\\_5"},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"search_terms":["using","minimal","correction","sets","more","efficiently","compute","minimal","unsatisfiable","sets","bacchus","katsirelos"],"keywords":[],"authorIDs":["5456ed818b01c81930000075"],"dataSources":["2LLKDfkxMDdABm58M"]}