Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems

, , &
Artificial Intelligence 58 (1-3):161-205 (1992)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(92)90007-k

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,709

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Heuristic evaluation functions in artificial intelligence search algorithms.Richard E. Korf - 1995 - Minds and Machines 5 (4):489-498.
Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem.Norman Sadeh & Mark S. Fox - 1996 - Artificial Intelligence 86 (1):1-41.
The complexity of recursive constraint satisfaction problems.Victor W. Marek & Jeffrey B. Remmel - 2010 - Annals of Pure and Applied Logic 161 (3):447-457.
Backtracking techniques for the job shop scheduling constraint satisfaction problem.Norman Sadeh, Katia Sycara & Yalin Xiong - 1995 - Artificial Intelligence 76 (1-2):455-480.
Variable-Centered Consistency in Model RB.Liang Li, Tian Liu & Ke Xu - 2013 - Minds and Machines 23 (1):95-103.
The Constraint Satisfaction Problem and Universal Algebra.Libor Barto - 2015 - Bulletin of Symbolic Logic 21 (3):319-337.
Ethical problems in register based medical research.Göran Hermerén - 1988 - Theoretical Medicine and Bioethics 9 (2).
A Compactness Theorem For Infinite Constraint Satisfaction.Robert Cowen - 1998 - Reports on Mathematical Logic:97-107.
Conflicts of Desire.Steven Arkonovich - 2012 - Journal of Value Inquiry 46 (1):51-63.
Constraint Satisfaction, Irredundant Axiomatisability and Continuous Colouring.Marcel Jackson & Belinda Trotta - 2013 - Studia Logica 101 (1):65-94.
Solving quantified constraint satisfaction problems.Ian P. Gent, Peter Nightingale, Andrew Rowley & Kostas Stergiou - 2008 - Artificial Intelligence 172 (6-7):738-771.
We can't have no satisfaction.Teresa Marques - 2016 - Filosofia Unisinos 17 (3):308-314.
A Hybrid Heuristic Algorithm for the Intelligent Transportation Scheduling Problem of the BRT System.Xu Haitao, Lin Fei, Chen Tao & Zheng Ning - 2015 - Journal of Intelligent Systems 24 (4):437-448.
A modified biogeography-based optimization algorithm with improved mutation operator for job shop scheduling problem with time lags.Madiha Harrabi, Olfa Belkahla Driss & Khaled Ghedira - forthcoming - Logic Journal of the IGPL.
Constraint-directed techniques for scheduling alternative activities.J. Christopher Beck & Mark S. Fox - 2000 - Artificial Intelligence 121 (1-2):211-250.

Analytics

Added to PP
2020-12-22

Downloads
5 (#1,536,375)

6 months
3 (#965,065)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The computational complexity of propositional STRIPS planning.Tom Bylander - 1994 - Artificial Intelligence 69 (1-2):165-204.
Exploiting the deep structure of constraint problems.Colin P. Williams & Tad Hogg - 1994 - Artificial Intelligence 70 (1-2):73-117.

View all 17 citations / Add more citations

References found in this work

Partial constraint satisfaction.Eugene C. Freuder & Richard J. Wallace - 1992 - Artificial Intelligence 58 (1-3):21-70.
Iterative broadening.Matthew L. Ginsberg & William D. Harvey - 1992 - Artificial Intelligence 55 (2-3):367-383.

Add more references