FMUS2: An Efficient Algorithm to Compute Minimal Unsatisfiable Subsets

Shaofan Liu, Jie Luo. FMUS2: An Efficient Algorithm to Compute Minimal Unsatisfiable Subsets. In Jacques D. Fleuriot, Dongming Wang, Jacques Calmet, editors, Artificial Intelligence and Symbolic Computation - 13th International Conference, AISC 2018, Suzhou, China, September 16-19, 2018, Proceedings. Volume 11110 of Lecture Notes in Computer Science, pages 104-118, Springer, 2018. [doi]

@inproceedings{LiuL18-48,
  title = {FMUS2: An Efficient Algorithm to Compute Minimal Unsatisfiable Subsets},
  author = {Shaofan Liu and Jie Luo},
  year = {2018},
  doi = {10.1007/978-3-319-99957-9_7},
  url = {https://doi.org/10.1007/978-3-319-99957-9_7},
  researchr = {https://researchr.org/publication/LiuL18-48},
  cites = {0},
  citedby = {0},
  pages = {104-118},
  booktitle = {Artificial Intelligence and Symbolic Computation - 13th International Conference, AISC 2018, Suzhou, China, September 16-19, 2018, Proceedings},
  editor = {Jacques D. Fleuriot and Dongming Wang and Jacques Calmet},
  volume = {11110},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-99957-9},
}