Integration of Constraint Programming, Artificial Intelligence, and Operations Research
16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4–7, 2019, Proceedings
Page
%P
-
Chapter and Conference Paper
MeAct: A Non-obstructive Persuasive End-to-End Platform for Active and Healthy Ageing Support
The essence of active ageing is embracing a healthy lifestyle, a choice that reflects on many aspects of a citizen’s everyday life and routine, namely consumption and nutrition patterns, physical activity and ...
-
Article
Adaptive constraint propagation in constraint satisfaction: review and evaluation
Several methods for dynamically adapting the local consistency property applied by a CP solver during search have been put forward in recent and older literature. We propose the classification of such methods ...
-
Article
Efficient multiple constraint acquisition
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 or negative. For each negative...
-
Chapter and Conference Paper
Omissions in Constraint Acquisition
Interactive constraint acquisition is a special case of query-directed learning, also known as “exact” learning. It is used to assist non-expert users in modeling a constraint problem automatically by posting ...
-
Book and Conference Proceedings
-
Chapter and Conference Paper
Structure-Driven Multiple Constraint Acquisition
MQuAcq is an algorithm for active constraint acquisition that has been shown to outperform previous algorithms such as QuAcq and MultiAcq
-
Article
Neighborhood singleton consistencies
CP solvers predominantly use arc consistency (AC) as the default propagation method for binary constraints. Many stronger consistencies, such as triangle consistencies (e.g. RPC and maxRPC) exist, but their us...
-
Chapter and Conference Paper
Efficient Methods for Constraint Acquisition
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 or negative. For each negative...
-
Article
Revisiting restricted path consistency
Restricted path consistency (RPC) is a strong local consistency for binary constraints that was proposed 20 years ago and was identified as a promising alternative to arc consistency (AC) in an early experimen...
-
Article
Strong local consistency algorithms for table constraints
Table constraints are important in constraint programming as they are present in many real problems from areas such as configuration and databases. As a result, numerous specialized algorithms that achieve gen...
-
Chapter and Conference Paper
Restricted Path Consistency Revisited
Restricted path consistency (RPC) is a strong local consistency for binary constraints that was proposed 20 years ago and was identified as a promising alternative to arc consistency (AC) in an early experimen...
-
Chapter and Conference Paper
Extending Generalized Arc Consistency
Generalized arc consistency (GAC) is the most widely used local consistency in constraint programming. Several GAC algorithms for specific constraints, as well as generic algorithms that can be used on any con...
-
Article
Overlay networks for task allocation and coordination in large-scale networks of cooperative agents
This paper proposes a novel method for scheduling and allocating atomic and complex tasks in large-scale networks of homogeneous or heterogeneous cooperative agents. Our method encapsulates the concepts of sea...
-
Article
New algorithms for max restricted path consistency
Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that enforces a higher order of consistency than arc consistency. Despite the strong pruning that can be achieved, maxRPC ...
-
Chapter and Conference Paper
Conflict Directed Variable Selection Strategies for Constraint Satisfaction Problems
It is well known that the order in which variables are instantiated by a backtracking search algorithm can make an enormous difference to the search effort in solving CSPs. Among the plethora of heuristics tha...
-
Chapter and Conference Paper
Improving the Performance of maxRPC
Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that can achieve considerably stronger pruning than arc consistency. However, existing maxRPC algorithms suffer from overh...
-
Article
Introduction to the special issue on quantified CSPs and QBF
-
Chapter and Conference Paper
Learning How to Propagate Using Random Probing
In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usually only apply a standard method, typi...
-
Chapter and Conference Paper
A Study of SAT-Based Branching Heuristics for the CSP
Constraint Satisfaction Problems (CSPs) and Propositional Satisfiability (SAT) are two closely related frameworks used for solving hard combinatorial problems. Despite their similarities regarding the problem ...
-
Chapter and Conference Paper
Solution Directed Backjum** for QCSP
In this paper we present new techniques for improving backtracking based Quantified Constraint Satisfaction Problem (QCSP) solvers. QCSP is a generalization of CSP in which variables are either universally or ...
