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
Towards a complete classification of tractability in point algebras for nonlinear time
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
1999 (English)In: Principles and Practice of Constraint Programming – CP’99: 5th International Conference, CP’99, Alexandria, VA, USA, October 11-14, 1999. Proceedings / [ed] Joxan Jaffar, Berlin: Springer, 1999, Vol. 1713, 129-143 p.Chapter in book (Refereed)
Abstract [en]

Efficient reasoning about temporal constraints over nonlinear time models is vital in numerous application areas, such as planning, distributed systems and cooperating agents. We identify all tractable subclasses of the point algebra for partially-ordered time and examine one large, nontrivial tractable subclass of the point algebra for branching time.

Place, publisher, year, edition, pages
Berlin: Springer, 1999. Vol. 1713, 129-143 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 1713
Keyword [en]
constraint programming, search problems, tractability, heuristics, routing problems, resource allocation, scheduling, satisfiability problems, constraint handling, constraint satisfaction problems
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-49637DOI: 10.1007/978-3-540-48085-3_10ISBN: 3-540-66626-5 (print)OAI: oai:DiVA.org:liu-49637DiVA: diva2:270533
Available from: 2009-10-11 Created: 2009-10-11 Last updated: 2017-02-23

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Broxvall, MathiasJonsson, Peter

Search in DiVA

By author/editor
Broxvall, MathiasJonsson, Peter
By organisation
TCSLAB - Theoretical Computer Science LaboratoryThe Institute of Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 67 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