Handling Conflicts in Depth-First Search for LTL Tableau to Debug Compliance Based Languages
Francois Hantry (UCBLyon France), Mohand-Said Hacid (UCBLyon France)

TL;DR
This paper introduces a novel conflict-driven depth-first search solver for Linear Temporal Logic (LTL) to efficiently identify inconsistent parts of compliance specifications, aiding early detection of conflicts in rule-based systems.
Contribution
It extends conflict-driven SAT solving techniques to temporal logic, enabling extraction of unsatisfiable cores in LTL without re-exploring previous search history.
Findings
Efficient extraction of LTL unsatisfiable cores.
Improved conflict detection in compliance rule systems.
No re-exploration of search history needed.
Abstract
Providing adequate tools to tackle the problem of inconsistent compliance rules is a critical research topic. This problem is of paramount importance to achieve automatic support for early declarative design and to support evolution of rules in contract-based or service-based systems. In this paper we investigate the problem of extracting temporal unsatisfiable cores in order to detect the inconsistent part of a specification. We extend conflict-driven SAT-solver to provide a new conflict-driven depth-first-search solver for temporal logic. We use this solver to compute LTL unsatisfiable cores without re-exploring the history of the solver.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
