Recursive online enumeration of all minimal unsatisfiable subsets

DOI10.1007/978-3-030-01090-4_9zbMath1517.68265arXiv1708.00400OpenAlexW2741064700MaRDI QIDQ6109586

Jaroslav Bendík, Ivana Černá, Nikola Beneš

Publication date: 28 July 2023

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.00400

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Computational aspects of satisfiability (68R07)

Related Items (3)

Counting minimal unsatisfiable subsets ⋮ Unnamed Item ⋮ Timed automata relaxation for reachability

This page was built for publication: Recursive online enumeration of all minimal unsatisfiable subsets