NDLI: Efficient Relaxations of Over-constrained CSPs

Content Provider	IEEE Xplore Digital Library
Author	Mencia, C. Marques-Silva, J.
Copyright Year	2014
Description	Author affiliation: Complex & Adaptive Syst. Lab., Univ. Coll. Dublin, Dublin, Ireland (Mencia, C.; Marques-Silva, J.)
Abstract	Constraint Programming is becoming the preferred solving technology in a variety of application domains. It is not unusual that a CSP modeling some real-life problem is found to be unfeasible or over-constrained. In this scenario, users may be interested in identifying the causes responsible for inconsistency, or in getting some advice so that they can reformulate their problem to render it feasible. This paper is concerned with the latter issue, which plays a very important role in the analysis of over-constrained problems. Concretely, we study the problem of computing a minimal exclusion set of constraints (MESC) from unfeasible CSPs. A MESC is a set-wise minimal set of constraints whose removal makes the original problem feasible. We provide an overview of existing techniques for MESC extraction and consider additional alternatives and optimizations. Our main contribution is the adaptation of one of the best-performing algorithms for SAT to work in CSP. We also integrate a technique that improves its efficiency. The results from an experimental study indicate considerable improvements over the state-of-the-art.
Starting Page	725
Ending Page	732
File Size	7306771
Page Count	8
File Format	PDF
ISBN	9781479965724
ISSN	10823409
DOI	10.1109/ICTAI.2014.113
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-11-10
Publisher Place	Cyprus
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Optimization Algorithm design and analysis Educational institutions Partitioning algorithms Computational modeling Instruments Context infeasibility relaxations MESC CSP
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An Improved F-M Partitioning Algorithm in Parallel Logic Simulation

Local Graph Partitioning using PageRank Vectors

A surrogate-assisted memetic co-evolutionary algorithm for expensive constrained optimization problems

A MapReduce based Ant Colony Optimization approach to combinatorial optimization problems

Notice of RetractionHybrid adaptive niche to improve particle swarm optimization clustering algorithm

Parallel K-Medoids clustering algorithm based on Hadoop

A New Efficient Simulation Equivalence Algorithm

Particle swarm optimization algorithm and its application to clustering analysis

A Non-Fragmenting Partitioning Algorithm for Hierarchical Models

Efficient Relaxations of Over-constrained CSPs

Similar Documents

An Improved F-M Partitioning Algorithm in Parallel Logic Simulation

Local Graph Partitioning using PageRank Vectors

A surrogate-assisted memetic co-evolutionary algorithm for expensive constrained optimization problems

A MapReduce based Ant Colony Optimization approach to combinatorial optimization problems

Notice of RetractionHybrid adaptive niche to improve particle swarm optimization clustering algorithm

Parallel K-Medoids clustering algorithm based on Hadoop

A New Efficient Simulation Equivalence Algorithm

Particle swarm optimization algorithm and its application to clustering analysis

A Non-Fragmenting Partitioning Algorithm for Hierarchical Models

Efficient Relaxations of Over-constrained CSPs