The logic of constraint satisfaction

DOI10.1016/0004-3702(92)90003-GzbMath0782.68104MaRDI QIDQ1204865

Alan K. Mackworth

Publication date: 1 April 1993

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

finite CSP

Mathematics Subject Classification ID

Related Items (15)

On finding optimal and near-optimal lineal spanning trees ⋮ Accelerating new product development by overcoming complexity constraints ⋮ Metaheuristics: A bibliography ⋮ Path consistency in clp(FD) ⋮ Connections between default reasoning and partial constraint satisfaction ⋮ Qualitative constraint satisfaction problems: an extended framework with landmarks ⋮ About the choice of the variable to unassign in a decision repair algorithm ⋮ Efficient algorithms for finding critical subgraphs ⋮ Parsing as non-Horn deduction ⋮ The descriptive component of a hybrid knowledge representation language ⋮ Handling contingency in temporal constraint networks: from consistency to controllabilities ⋮ Linear programs for constraint satisfaction problems ⋮ Constraint propagation techniques for the disjunctive scheduling problem ⋮ On the computational complexity of querying bounds on differences constraints ⋮ Constraint solving in uncertain and dynamic environments: A survey

Cites Work

• A logical framework for depiction and image interpretation
• Constraint propagation with interval labels
• Constraint satisfaction from a deductive viewpoint
• Consistency in networks of relations
• Networks of constraints: Fundamental properties and applications to picture processing
• Constraint relaxation may be perfect
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• New problems complete for nondeterministic log space
• On the Complexity of Timetable and Multicommodity Flow Problems
• A Proof Procedure Using Connection Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The logic of constraint satisfaction