Title :
Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction
Author :
Hubie Chen;Michal Wrona
Author_Institution :
Dept. de Tecnologies, Univ. Pompeu Fabra, Barcelona, Spain
Abstract :
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.
Keywords :
"Games","Complexity theory","Cognition","Orbits","Syntactics","Computational modeling","Concrete"
Conference_Titel :
Temporal Representation and Reasoning (TIME), 2012 19th International Symposium on
Print_ISBN :
978-1-4673-2659-9
Electronic_ISBN :
2332-6468
DOI :
10.1109/TIME.2012.19
