liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Semilinear Program Feasibility
CNRS/LIX, École Polytechnique, 91128 Palaiseau, France.
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
Max-Planck-Institute for Human Development, Königin-Luise-Strasse 5, 14195, Berlin.
2009 (English)In: Automata, Languages and Programming, Berlin / Heidelberg: Springer , 2009, 79-90 p.Conference paper, Published paper (Refereed)
Abstract [en]

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.
Series
Lecture Notes In Computer Science, ISSN 0302-9743 (Print) 1611-3349 (Online) ; 5556
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-52638DOI: 10.1007/978-3-642-02930-1_7ISBN: 978-3-642-02929-5 (print)OAI: oai:DiVA.org:liu-52638DiVA: diva2:284374
Conference
ICALP-2009
Available from: 2010-01-06 Created: 2010-01-06 Last updated: 2017-02-23

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Jonsson, Peter

Search in DiVA

By author/editor
Jonsson, Peter
By organisation
TCSLAB - Theoretical Computer Science LaboratoryThe Institute of Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 43 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf