NDLI: Small Unsatisfiable Subsets in Constraint Satisfaction

Content Provider	IEEE Xplore Digital Library
Author	De Haan, R. Kanj, I. Szeider, S.
Copyright Year	2014
Description	Author affiliation: Sch. of Comput., DePaul Univ., Chicago, IL, USA (Kanj, I.) \|\| Inst. of Inf. Syst., Vienna Univ. of Technol., Vienna, Austria (De Haan, R.; Szeider, S.)
Abstract	The problem of finding small unsatisfiable subsets of a set of constraints is important for various applications in computer science and artificial intelligence. We study the problem of identifying whether a given instance to the constraint satisfaction problem (CSP) has an unsatisfiable subset of size at most k from a parameterized complexity point of view. We show that the problem of finding small unsatisfiable subsets of a CSP instance is harder than the corresponding problem for CNF formulas. Moreover, we show that the problem is not fixed-parameter tractable when restricting the problem to any maximal tractable Boolean constraint language (for which the problem is nontrivial). We show that the problem is hard even when the maximum number of occurrences of any variable is bounded by a constant, a restriction which leads to fixed-parameter tractability for the case of CNF formulas. Finally, we relate the problem of finding small unsatisfiable subsets to the problem of identifying variable assignments that are enforced already by a small number of constraints (backbones), or that are ruled out already by a small number of constraints (anti-backbones).
Starting Page	429
Ending Page	436
File Size	795976
Page Count	8
File Format	PDF
ISBN	9781479965724
ISSN	10823409
DOI	10.1109/ICTAI.2014.72
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	Complexity theory Polynomials Educational institutions Force Artificial intelligence Information systems Reactive power local backbones small unsatisfiable subsets parameterized complexity constraint satisfaction Boolean constraint languages
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

Parameterized complexity of constraint satisfaction problems

Constraint Satisfaction Problems of Bounded Width

Boolean functions, invariance groups and parallel complexity

Fixed-parameter algorithms for artificial intelligence, constraint satisfaction, and database problems (2007).

The complexity of homomorphism and constraint satisfaction problems seen from the other side

Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints

The complexity of Boolean constraint satisfaction local search problems

A constraint sequent calculus

Parameterized complexity of constraint satisfaction problems (2004).

Small Unsatisfiable Subsets in Constraint Satisfaction

Similar Documents

Parameterized complexity of constraint satisfaction problems

Constraint Satisfaction Problems of Bounded Width

Boolean functions, invariance groups and parallel complexity

Fixed-parameter algorithms for artificial intelligence, constraint satisfaction, and database problems (2007).

The complexity of homomorphism and constraint satisfaction problems seen from the other side

Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints

The complexity of Boolean constraint satisfaction local search problems

A constraint sequent calculus

Parameterized complexity of constraint satisfaction problems (2004).

Small Unsatisfiable Subsets in Constraint Satisfaction