Semilinear Program Feasibility
2009 (English)In: Automata, Languages and Programming, Berlin / Heidelberg: Springer , 2009, 79-90 p.Conference paper (Refereed)
We study logical techniques for deciding the computational complexity of infinite-domain constraint satisfaction problems (CSPs). For the fundamental algebraic structure where are the real numbers and L 1,L 2,... is an enumeration of all linear relations with rational coefficients, we prove that a semilinear relation R (i.e., a relation that is first-order definable with linear inequalities) either has a quantifier-free Horn definition in Γ or the CSP for is NP-hard. The result implies a complexity dichotomy for all constraint languages that are first-order expansions of Γ: the corresponding CSPs are either in P or are NP-complete depending on the choice of allowed relations. We apply this result to two concrete examples (generalised linear programming and metric temporal reasoning) and obtain full complexity dichotomies in both cases.
Place, publisher, year, edition, pages
Berlin / Heidelberg: Springer , 2009. 79-90 p.
, Lecture Notes In Computer Science, ISSN 0302-9743 (Print) 1611-3349 (Online) ; 5556
IdentifiersURN: urn:nbn:se:liu:diva-52638DOI: 10.1007/978-3-642-02930-1_7ISBN: 978-3-642-02929-5OAI: oai:DiVA.org:liu-52638DiVA: diva2:284374