Proceedings

Fast Algorithms for Lexicographic Inference

Download BibTeX Cite

Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence. Main Track. Pages 3917-3925.

https://doi.org/10.24963/ijcai.2026/436

Abstract

We present two new algorithms for the problem of lexicographic inference from conditional knowledge bases. These algorithms are based on SAT and MaxSAT encodings of the underlying problem of lexicographic comparisons of classical interpretations and require only a polynomial number of SAT solver calls. In our experimental evaluation we show that our new algorithms signficantly outperform the state of the art.

Jonas Klein, and Matthias Thimm. 2026. Fast Algorithms for Lexicographic Inference. In Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-26. IJCAI, 3917–3925. https://doi.org/10.24963/ijcai.2026/436
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards