8 citations · 59 across the 30 of their papers we have counts for
13 papers · 1 filter
Tractability of Quantified Temporal Constraints To The Max
Manuel Bodirsky, Hubie Chen, Michał Wrona
A temporal constraint language is a set of relations that are first-order definable over (Q;<). We show that several temporal constraint languages whose constraint satisfaction pro…
The Logic of Counting Query Answers
Hubie Chen, Stefan Mengel
We consider the problem of counting the number of answers to a first-order formula on a finite structure. We present and study an extension of first-order logic in which algorithms…
The Tractability Frontier of Graph-Like First-Order Query Sets
Hubie Chen
We study first-order model checking, by which we refer to the problem of deciding whether or not a given first-order sentence is satisfied by a given finite structure. In particula…
An Algebraic Hardness Criterion for Surjective Constraint Satisfaction
Hubie Chen
The constraint satisfaction problem (CSP) on a relational structure B is to decide, given a set of constraints on variables where the relations come from B, whether or not there is…
Beyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction
Hubie Chen
We consider the quantified constraint satisfaction problem (QCSP) which is to decide, given a structure and a first-order sentence (not assumed here to be in prenex form) built fro…
Quantified Constraints and Containment Problems
Barnaby D. Martin, Hubie Chen, Florent R. Madelaine
The quantified constraint satisfaction problem is the problem to decide whether a positive Horn sentence, involving nothing more than the two quantifie…