Johanna Groven — accepted AI-conference papers

2026

Maximum Satisfiability of Simple Temporal Problems

Johannes K. Fichte, Johanna Groven, Peter Jonsson, Victor Lagerkvist, Jorke M. de Vlas

IJCAI 2026

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 ca

Cited by 0 Scholar ↗

2026

Structure-Aware Encodings of Argumentation Properties for Clique-width

Yasir Mahmood, Markus Hecher, Johanna Groven, Johannes K. Fichte

AAAI 2026technical

Structural measures of graphs, such as treewidth, are central tools in computational complexity resulting in efficient algorithms when exploiting the parameter. It is even known that modern SAT solvers work efficiently on instances of small treewidth. Since these solvers are widely applied, research

Cited by 0 Source ↗PDF ↗Scholar ↗

2026

Towards Single Exponential Time for Temporal and Spatial Reasoning: A Study via Redundancy and Dynamic Programming

Victor Lagerkvist, Johanna Groven, Leif Eriksson

AAAI 2026technical

The region connection calculus (RCC) and Allen

Cited by 0 Source ↗PDF ↗Scholar ↗