A Fine-Grained Complexity View on Propositional Abduction - Algorithms and Lower Bounds

Cite

Text

Lagerkvist et al. "A Fine-Grained Complexity View on Propositional Abduction - Algorithms and Lower Bounds." International Joint Conference on Artificial Intelligence, 2025. doi:10.24963/IJCAI.2025/508

Markdown

[Lagerkvist et al. "A Fine-Grained Complexity View on Propositional Abduction - Algorithms and Lower Bounds." International Joint Conference on Artificial Intelligence, 2025.](https://mlanthology.org/ijcai/2025/lagerkvist2025ijcai-fine/) doi:10.24963/IJCAI.2025/508

BibTeX

@inproceedings{lagerkvist2025ijcai-fine,
  title     = {{A Fine-Grained Complexity View on Propositional Abduction - Algorithms and Lower Bounds}},
  author    = {Lagerkvist, Victor and Maizia, Mohamed and Schmidt, Johannes},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2025},
  pages     = {4562-4569},
  doi       = {10.24963/IJCAI.2025/508},
  url       = {https://mlanthology.org/ijcai/2025/lagerkvist2025ijcai-fine/}
}