{"paper":{"title":"A complexity dichotomy for poset constraint satisfaction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.CC","authors_text":"Michael Kompatscher, Trung Van Pham","submitted_at":"2016-02-29T22:45:49Z","abstract_excerpt":"In this paper we determine the complexity of a broad class of problems that extends the temporal constraint satisfaction problems. To be more precise we study the problems Poset-SAT($\\Phi$), where $\\Phi$ is a given set of quantifier-free $\\leq$-formulas. An instance of Poset-SAT($\\Phi$) consists of finitely many variables $x_1,\\ldots,x_n$ and formulas $\\phi_i(x_{i_1},\\ldots,x_{i_k})$ with $\\phi_i \\in \\Phi$; the question is whether this input is satisfied by any partial order on $x_1,\\ldots,x_n$ or not. We show that every such problem is NP-complete or can be solved in polynomial time, dependin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00082","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}