@inproceedings{DBLP:conf/ismvl/BofillBEV26,
  author       = {Miquel Bofill and
                  Cristina Borralleras and
                  Joan Espasa and
                  Mateu Villaret},
  title        = {A Spanning Tree-Based {SAT} Encoding for Reachability in Undirected
                  Graphs},
  booktitle    = {56th {IEEE} International Symposium on Multiple-Valued Logic, {ISMVL}
                  2026, Sendai, Japan, May 19-21, 2026},
  pages        = {37--42},
  publisher    = {{IEEE}},
  year         = {2026},
  url          = {https://doi.org/10.1109/ISMVL68998.2026.00016},
  doi          = {10.1109/ISMVL68998.2026.00016},
  timestamp    = {Wed, 24 Jun 2026 08:03:33 +0200},
  biburl       = {https://dblp.org/rec/conf/ismvl/BofillBEV26.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}