Conference
Jul 2026
Maximum Satisfiability of Simple Temporal Problems
The Simple Temporal Problem (STP) is a core framework for quantitative temporal constraints. As STP data can be inconsistent, we study MaxSTP: compute a maximum-cardinality consistent subset of constraints. This extension is NP-hard, and we analyze its parameterized complexity under measures that capture practically re...
J. Fichte, Johanna Groven, Peter Jonsson et al.
· Proceedings of the Thirty-Fi... · 0 citations