NDLI: Boosting MUC extraction in unsatisfiable constraint networks

Content Provider	Springer Nature Link
Author	Grégoire, Éric Lagniez, Jean Marie Mazure, Bertrand
Copyright Year	2014
Abstract	One very fertile domain of applied Artificial Intelligence is constraint solving technologies. Especially, constraint networks that concern problems that can be represented using discrete variables, together with constraints on allowed instantiation values for these variables. Every solution to a constraint network must satisfy every constraint. When no solution exists, the user might want to know the actual reasons leading to the absence of global solution. In this respect, extracting mucs (Minimal Unsatisfiable Cores) from an unsatisfiable constraint network is a useful process when causes of unsatisfiability must be understood so that the network can be re-engineered and relaxed to become satisfiable. Despite bad worst-case computational complexity results, various muc-finding approaches that appear tractable for many real-life instances have been proposed. Many of them are based on the successive identification of so-called transition constraints. In this respect, we show how local search can be used to possibly extract additional transition constraints at each main iteration step. In the general constraint networks setting, the approach is shown to outperform a technique based on a form of model rotation imported from the sat-related technology and that also exhibits additional transition constraints. Our extensive computational experimentations show that this enhancement also boosts the performance of state-of-the-art DC(WCORE)-like MUC extractors.
Starting Page	1012
Ending Page	1023
Page Count	12
File Format	PDF
ISSN	0924669X
Journal	Applied Intelligence
Volume Number	41
Issue Number	4
e-ISSN	15737497
Language	English
Publisher	Springer US
Publisher Date	2014-06-26
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Constraint solving problems CSP Constraint network MUC Unsatisfiable core Stochastic local search SLS Artificial Intelligence (incl. Robotics) Mechanical Engineering Manufacturing, Machines, Tools
Content Type	Text
Resource Type	Article
Subject	Artificial Intelligence

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

A Mixed Closure-CSP Method for Solving Scheduling Problems

Conditional and composite temporal CSPs

A Connectionist Approach for Solving Large Constraint Satisfaction Problems

Knowledge Extraction from Transducer Neural Networks

Querying Temporal Constraint Networks: A Unifying Approach

More efficient two-mode stochastic local search for random 3-satisfiability

A Distributed Artificial Network Solving Complex and Multiple Causal Associations

Solving Electrical Distribution Problems Using Hybrid Evolutionary Data Analysis Techniques

Variable ordering and constraint propagation for constrained CP-nets

Boosting MUC extraction in unsatisfiable constraint networks

Similar Documents

A Mixed Closure-CSP Method for Solving Scheduling Problems

Conditional and composite temporal CSPs

A Connectionist Approach for Solving Large Constraint Satisfaction Problems

Knowledge Extraction from Transducer Neural Networks

Querying Temporal Constraint Networks: A Unifying Approach

More efficient two-mode stochastic local search for random 3-satisfiability

A Distributed Artificial Network Solving Complex and Multiple Causal Associations

Solving Electrical Distribution Problems Using Hybrid Evolutionary Data Analysis Techniques

Variable ordering and constraint propagation for constrained CP-nets

Boosting MUC extraction in unsatisfiable constraint networks