NDLI: On the minimality and global consistency of row-convex constraint networks

Content Provider	ACM Digital Library
Author	van Beek, Peter Dechter, Rina
Copyright Year	1995
Abstract	Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint network, we often wish to (i) find a solution that satisfies the constraints and (ii) find the corresponding minimal network where the constraints are as explicit as possible. Both tasks are known to be NP-complete in the general case. Task (1) is usually solved using a backtracking algorithm, and task (ii) is often solved only approximately by enforcing various levels of local consistency. In this paper, we identify a property of binary constraint called row convexity and show its usefulness in deciding when a form of local consistency called path consistency is sufficient to guarantee that a network is both minimal and globally consistent. Globally consistent networks have the property that a solution can be found without backtracking. We show that one can test for the row convexity property efficiently and we show, by examining applications of constraint networks discussed in the literature, that our results are useful in practice. Thus, we identify a class of binary constraint networks for which we can solve both tasks (i) and (ii) efficiently. Finally, we generalize the results for binary constraint networks to networks with nonbinary constraints.
Starting Page	543
Ending Page	561
Page Count	19
File Format	PDF
ISSN	00045411
e-ISSN	1557735X
DOI	10.1145/210346.210347
Journal	Journal of the ACM (JACM)
Volume Number	42
Issue Number	3
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1995-05-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Consecutive ones property Constraint networks Constraint satisfaction problems Constraint-based reasoning Path consistency Relations Row convexity
Content Type	Text
Resource Type	Article
Subject	Hardware and Architecture Information Systems Control and Systems Engineering Artificial Intelligence Software

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

On the minimality and global consistency of row-convex constraint networks (1992).

Constraint tightness and looseness versus local and global consistency

On the Minimality and Global Consistency of Row-Convex Constraint Networks (1995)

On the minimality and global consistency of row-convex constraint networks (1995)

On binary constraint problems

Erratum: P. van Beek and R. Dechter's theorem on constraint looseness and local consistency

Constraint Satisfaction Problems Solvable by Local Consistency Methods

On the Minimality and Decomposability of Constraint Networks (1992)

Semiring-based constraint satisfaction and optimization

On the minimality and global consistency of row-convex constraint networks

Similar Documents

On the minimality and global consistency of row-convex constraint networks (1992).

Constraint tightness and looseness versus local and global consistency

On the Minimality and Global Consistency of Row-Convex Constraint Networks (1995)

On the minimality and global consistency of row-convex constraint networks (1995)

On binary constraint problems

Erratum: P. van Beek and R. Dechter's theorem on constraint looseness and local consistency

Constraint Satisfaction Problems Solvable by Local Consistency Methods

On the Minimality and Decomposability of Constraint Networks (1992)

Semiring-based constraint satisfaction and optimization

On the minimality and global consistency of row-convex constraint networks