Back to search

On the minimality and decomposability of constraint networks

Data up to Jan 2025

Published1992
Citations38
References22

Total Citations Per Year

Abstract

References (22)

Maintaining knowledge about temporal intervals

1983 • 7,583 citations

Consistency in networks of relations

1977 • 2,477 citations

Temporal constraint networks

1991 • 1,810 citations

Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

1976 • 1,525 citations

Networks of constraints: Fundamental properties and applications to picture processing

1974 • 1,283 citations

Understanding Line drawings of Scenes with Shadows

1975 • 897 citations

On seeing things

1971 • 685 citations

A Sufficient Condition for Backtrack-Free Search

1982 • 667 citations

The complexity of some polynomial network consistency algorithms for constraint satisfaction problems

1985 • 628 citations

Network-based heuristics for constraint-satisfaction problems

1987 • 575 citations

Synthesizing constraint expressions

1978 • 540 citations

A sufficient condition for backtrack-bounded search

1985 • 280 citations

Complexity of K-tree structured constraint satisfaction problems

1990 • 189 citations

The complexity of recognizing polyhedral scenes

1988 • 150 citations

Structural disambiguation with constraint propagation

1990 • 144 citations

Approximation algorithms for temporal reasoning

1989 • 110 citations

An efficient arc consistency algorithm for a class of CSP problems

1991 • 76 citations

Reasoning about qualitative temporal information

1994 • 50 citations

The complexity of recognizing polyhedral scenes

1985 • 40 citations

Directed constraint networks: a relational framework for causal modeling

1991 • 28 citations

Tree decomposition with applications to constraint processing

1990 • 13 citations

From local to global consistency

1990 • 9 citations

Cited By (0)

Loading...