[BOOK][B] Handbook of knowledge representation

F Van Harmelen, V Lifschitz, B Porter - 2008 - books.google.com
Handbook of Knowledge Representation describes the essential foundations of Knowledge
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …

Symmetry in constraint programming

IP Gent, KE Petrie, JF Puget - Foundations of Artificial Intelligence, 2006 - Elsevier
Publisher Summary This chapter reviews that symmetry in constraints has always been
important but in recent years has become a major research area in its own right. A key …

Constraint programming

F Rossi, P Van Beek, T Walsh - Foundations of Artificial Intelligence, 2008 - Elsevier
Publisher Summary Constraint programming is a powerful paradigm for solving
combinatorial search problems that draws on a wide range of techniques from artificial …

[HTML][HTML] Constrained clustering by constraint programming

KC Duong, C Vrain - Artificial Intelligence, 2017 - Elsevier
Constrained Clustering allows to make the clustering task more accurate by integrating user
constraints, which can be instance-level or cluster-level constraints. Few works consider the …

[BOOK][B] Improving combinatorial optimization

GG Chu - 2011 - minerva-access.unimelb.edu.au
Combinatorial Optimization is an important area of computer science that has many
theoretical and practical applications. In this thesis, we present important contributions to …

General symmetry breaking constraints

T Walsh - International Conference on Principles and Practice of …, 2006 - Springer
We describe some new propagators for breaking symmetries in constraint satisfaction
problems. We also introduce symmetry breaking constraints to deal with symmetries acting …

Symmetry and satisfiability

KA Sakallah - Handbook of Satisfiability, 2021 - ebooks.iospress.nl
Symmetry is at once a familiar concept (we recognize it when we see it!) and a profoundly
deep mathematical subject. At its most basic, a symmetry is some transformation of an object …

Reformulations in mathematical programming: automatic symmetry detection and exploitation

L Liberti - Mathematical Programming, 2012 - Springer
If a mathematical program has many symmetric optima, solving it via Branch-and-Bound
techniques often yields search trees of disproportionate sizes; thus, finding and exploiting …

A constraint solver for software engineering: finding models and cores of large relational specifications

E Torlak - 2009 - dspace.mit.edu
Relational logic is an attractive candidate for a software description language, because both
the design and implementation of software often involve reasoning about relational …

A new binary programming formulation and social choice property for Kemeny rank aggregation

Y Yoo, AR Escobedo - Decision Analysis, 2021 - pubsonline.informs.org
Rank aggregation is widely used in group decision making and many other applications,
where it is of interest to consolidate heterogeneous ordered lists. Oftentimes, these rankings …