AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach

AAAI 2022 · Learning theory and algorithms › Combinatorial and search optimization · approach: Logic and answer set programming theory · 1 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Reduce one-sided constraints to Directed Subset Feedback Arc SetALMOSTCSP(S≥) · One-sided STP relationsparameterized complexity: in FPTHelped
Use iterative compression with an Edge Multicut subroutineALMOSTCSP(S=) · Equation STP relationsparameterized complexity: in FPTHelped
Restrict the constraint language to relations containing (0, 0)ALMOSTCSP(A) · A ⊆ S0classical complexity: constant-time solvableHelped
Allow non-trivial one-sided relationsALMOSTCSP(A) · One-sided STP fragmentsparameterized complexity: NP-hard; in FPTMixed
Allow non-zero equation relationsALMOSTCSP(A) · Equation STP fragmentsparameterized complexity: NP-hard; in FPTMixed
Use any other non-trivial fragment beyond the one-sided and equation casesALMOSTCSP(A) · Remaining STP fragmentsparameterized complexity: W[1]-hardHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy