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

Direct link
Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction
Universitat Pompeu Fabra, Barcelona, Spain.
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology. (TCSLAB)
2012 (English)Conference paper (Other academic)
Abstract [en]

The first-order theory of dense linear orders without endpoints is well-known to be PSPACE-complete. We present polynomial-time tractability results for fragments of this theory which are defined by syntactic restriction, in particular, our fragments can be described using the framework of quantified constraint satisfaction over Ord-Horn clauses.

Place, publisher, year, edition, pages
IEEE , 2012. 99-106 p.
National Category
Computer Science
URN: urn:nbn:se:liu:diva-79512DOI: 10.1109/TIME.2012.19ISBN: 978-1-4673-2659-9OAI: diva2:543172
19th International Symposium on Temporal Representation and Reasoning (TIME-2012), 12-14 September, Leicester, UK
Available from: 2012-08-06 Created: 2012-08-06 Last updated: 2014-11-12

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Wrona, Michal
By organisation
Software and SystemsThe Institute of Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 45 hits
ReferencesLink to record
Permanent link

Direct link