28 citations · 44 across the 9 of their papers we have counts for
10 papers
Overcoming Over-Fitting in Constraint Acquisition via Query-Driven Interactive Refinement
Vasileios Balafas, Dimos Tsouros, Nikolaos Ploskas +1
Manual modeling in Constraint Programming is a substantial bottleneck, which Constraint Acquisition (CA) aims to automate. However, passive CA methods are prone to over-fitting, of…
Integer programming models for the semi-obnoxious p-median problem
Nikolaos Ploskas, Kostas Stergiou
The p-median problem concerns the location of facilities so that the sum of distances between the demand points and their nearest facility is minimized. We study a variant of this…
Efficient Multiple Constraint Acquisition
Dimosthenis C. Tsouros, Kostas Stergiou
Constraint acquisition systems such as QuAcq and MultiAcq can assist non-expert users to model their problems as constraint networks by classifying (partial) examples as positive o…
Partial Queries for Constraint Acquisition
Christian Bessiere, Clement Carbonnel, Anton Dries +8
Learning constraint networks is known to require a number of membership queries exponential in the number of variables. In this paper, we learn constraint networks by asking the us…
Exploiting the Pruning Power of Strong Local Consistencies Through Parallelization
Minas Dasygenis, Kostas Stergiou
Local consistencies stronger than arc consistency have received a lot of attention since the early days of CSP research. %because of the strong pruning they can achieve. However, t…
Binary Encodings of Non-binary Constraint Satisfaction Problems: Algorithms and Experimental Results
N. Samaras, K. Stergiou
A non-binary Constraint Satisfaction Problem (CSP) can be solved directly using extended versions of binary techniques. Alternatively, the non-binary problem can be translated into…
Experimental Evaluation of Branching Schemes for the CSP
Thanasis Balafoutis, Anastasia Paparrizou, Kostas Stergiou
The search strategy of a CP solver is determined by the variable and value ordering heuristics it employs and by the branching scheme it follows. Although the effects of variable a…
Improving the Performance of maxRPC
Thanasis Balafoutis, Anastasia Paparrizou, Kostas Stergiou +1
Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that can achieve considerably stronger pruning than arc consistency. However, existing maxRRC…
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
Thanasis Balafoutis, Kostas Stergiou
A key factor that can dramatically reduce the search space during constraint solving is the criterion under which the variable to be instantiated next is selected. For this purpose…
Adaptive Branching for Constraint Satisfaction Problems
Thanasis Balafoutis, Kostas Stergiou
The two standard branching schemes for CSPs are d-way and 2-way branching. Although it has been shown that in theory the latter can be exponentially more effective than the former,…