-
[Dechter01]
-
Rina Dechter.
Constraint Processing.
Morgan Kaufmann, September 2001.
[ http ]
-
[Larrosa00]
-
Javier Larrosa.
Boosting search with variable elimination.
In Principles and Practice of Constraint Programming, pages
291--305, 2000.
[ .ps ]
-
[MillsTsang99]
-
Patrick Mills and Edward P.K. Tsang.
Guided local search applied to the SAT problem.
Technical report, Department of Computer Science, Universit of Essex,
Colchester, UK, 1999.
-
[HarperEtal99]
-
Mary P. Harper, C. M. White, R. A. Helzerman, and S. A. Hockema.
Faster MUSE CSP arc consistency algorithms.
In Proceedings of the IASTED International Conference on
Artificial Intelligence and Soft Computing, Honolulu, Hawai, 1999.
-
[VoudourisTsang98]
-
Christos Voudouris and Edward P.K. Tsang.
Guided local search and its application to the traveling salesman
problem.
In European Journal of Operation Research, volume 113, Issue 2,
pages 469--499, November 1998.
-
[VoudourisTsang98a]
-
Christos Voudouris and Edward P.K. Tsang.
Solving the radio link frequency assignment problem using guided
local search.
In Proceedings of the NATO Symposium on Radio Link Frequency
Assignment, Sharing and Conservation Systems (Aerospace), Aalborg, Denmark,
October 1998.
-
[Voudouris98]
-
Christos Voudouris.
Guided local search -- an illustrative example in function
optimisation.
In BT Technology Journal, volume 16, pages 46--50, July 1998.
-
[LiretEtal98]
-
Anne Liret, Pierre Roy, and Francois Pachet.
Conception par objets d'un système pour combiner raisonnement
formel et satisfaction de contraintes.
Journées Francophones des Langages Applicatifs, JFLA'98, Lac de
Côme, Italie, Février 1998.
-
[Apt98a]
-
Krzysztof Apt.
The Essence of Constraint Propagation.
1998.
Submitted for publication.
-
[Apt98]
-
Krzysztof Apt.
A Proof Theoretic View of Constraint Programming.
1998.
Submitted for publication.
-
[LiretEtal97a]
-
Anne Liret, Pierre Roy, and Francois Pachet.
Conception par objets d'un système pour combiner raisonnement
formel et satisfaction de contraintes.
Journées du Pôle Programmation par Objets du PRC/GDR
Programmation, Rennes, France, Novembre 1997.
-
[LiretEtal97]
-
Anne Liret, Pierre Roy, and Francois Pachet.
Combining formal reasoning techniques with csp, October 1997.
-
[BockmayrEisenbrand97]
-
Alexander Bockmayr and Friedrich Eisenbrand.
On the chvatal rank of polytopes in the 0/1 cube.
Research Report MPI-I-97-2-009, Max Planck Institut für
Informatik, Saarbruecken, September 1997.
-
[BockmayrKasper97]
-
Alexander Bockmayr and Thomas Kasper.
A unifying framework for integer and finite domain constraint
programming.
Research Report MPI-I-97-2-008, Max Planck Institut für
Informatik, Saarbruecken, August 1997.
-
[KiblyEtal97]
-
P. Kibly, P. Prosser, and P. Shaw.
Guided local search for the vehicle routing problem.
In Processes of the 2nd International Conference on
Meta-Heuristics, July 1997.
-
[Solnon97]
-
Christine Solnon.
Coopération de solveurs linéaires sur les réels pour la
résolution de problèmes linéaires sur les entiers.
In Frédéric Benhamou, editor, Sixièmes Journées
Francophones de Programmation Logique et Programmation par Contraintes,
JFPLC'97, pages 211--225, Orléans, France, Mai 1997. Hermes.
-
[ILOGSolver40UsersManual97]
-
ILOG Solver 4.0, User's Manual, May 1997.
-
[Zhou97]
-
Jianyang Zhou.
Calcul de plus petits produits cartésiens d'intervalles:
application au problème d'ordonnancement d'atelier.
PhD thesis, Université de la Mediterranée, Aix-Marseille II,
March 1997.
-
[PodelskiSmolka97]
-
Andreas Podelski and Gert Smolka.
Situated Simplification.
Theoretical Computer Science, 173:209--233, February 1997.
-
[Wurtz97]
-
J. Würtz.
Constraint-Based Scheduling in Oz.
In Symposium on Operations Research, Braunschweig, Germany,
1997. LNCS, Springer-Verlag.
To appear.
-
[Walser97]
-
Joachim P. Walser.
Solving Linear Pseudo-Boolean Constraint Problems with Local
Search.
In Proceedings of the fourteenth national Conference on
Artificial Intelligence (AAAI '97), 1997.
To appear.
-
[Voudouris97]
-
Christos Voudouris.
Guided Local Search for Combinatorial Optimisation Problems.
PhD thesis, Department of Computer Science, University of Essex,
Colchester, UK, 1997.
-
[VerfaillieGivry97]
-
Gérard Verfaillie and Simon de Givry.
Algorithmic problems and solutions in the Valued Constraint
Satisfaction Problem framework.
In Proceedings of the EUFIT97 session on Valued Constraint
Satisfaction Aachen, Germany, 1997.
To appear.
-
[Schulte97]
-
Christian Schulte.
Oz Explorer: A Visual Constraint Programming Tool.
In Lee Naish, editor, Proceedings of the Fourteenth
International Conference on Logic Programming, Leuven, Belgium, 8-11 July
1997. The MIT Press.
To appear.
-
[LobjoisLematre97]
-
L. Lobjois and M. Lemaître.
Coopération entre méthodes complètes et incomplètes pour la
résolution de (V)CSP : une tentative d'inventaire.
In Actes de la Troisième Conférence Nationale sur la
Résolution pratique de Problèmes NP-complet, NPC97, Rennes, France,
pages 67--73, 1997.
-
[LematreVerfaillie97]
-
M. Lemaître and G. Verfaillie.
An Incomplete Method for Solving Distributed Valued Constraint
Satisfaction Problems.
In Proceedings of the AAAI97 Workshop on Constraints and Agents
Providence, Rhode Island, USA, 1997.
To appear.
-
[KondrakBeek97]
-
Grzegorz Kondrak and Peter Van Beek.
A theoretical evaluation of selected backtracking algorithms.
Artificial Intelligence, 89(1-2):365--387, January 1997.
-
[GivryVerfaillie97a]
-
S. de Givry and G. Verfaillie.
Optimum Anytime Bounding for Constraint Optimization Problems.
In Proceedings of the AAAI97 Workshop on Building
Resource-Bounded Reasoning Systems, Providence, Rhode Island, USA, 1997.
To appear.
-
[GivryVerfaillie97]
-
S. de Givry and G. Verfaillie.
Problèmes d'optimisation sous contraintes: Encadrement ANYTIME de
l'optimum.
In Actes de la Troisième Conférence Nationale sur la
Résolution pratique de Problèmes NP-complets, JNPC97, Rennes, France,
pages 33--39, 1997.
-
[Csontoc97]
-
Július Csontó and Ján Paralič.
A Look at CLP: Theory and Application.
Applied Artificial Intelligence, 11(1):59--69, January-February
1997.
-
[BarthBockmayr97]
-
P. Barth and A. Bockmayr.
PLAM: ProLog and Algebraic Modelling.
In Proceedings of the Fifth International Conference on the
Practical Application of Prolog, pages 73--82, London, UK, 1997. The
Practical Application Company.
-
[AptSchaerf97]
-
Krzysztof Apt and Andrea Schaerf.
Search and Imperative Programming.
In Proceedings of 24th ACM SIGPLAN-SIGACT Symposium on
Programming Languages, POPL'97, pages 67--79, 1997.
-
[Apt97]
-
Krzysztof Apt.
From Chaotic Iteration to Constraint Propagation.
In Proceedings of 24th International Colloquium on Automata,
Languages and Programming, ICALP'97, volume 1256 of Lecture Notes in
Computer Science, pages 36--55. Springer-Verlag, 1997.
-
[AartsEtal97]
-
Emile H. L. Aarts and Jan Karel Lenstra, editors.
Local Search in Combinatorial Optimization.
Series in Discrete Mathematics and Optimization. John Wiley & Sons,
Chichester, New York, Weinheim, Brisbane, Singapore, Toronto, 1997.
-
[Smolka96]
-
Gert Smolka.
Problem Solving with Constraints and Programming.
ACM Computing Surveys, 28(4es), December 1996.
Electronic Section.
-
[Monfroy96]
-
Eric Monfroy.
Collaboration de solveurs pour la programmation logique à
contraintes.
PhD thesis, Université Henri Poincaré - Nancy 1,
November 1996.
-
[BorrettEtal96]
-
Borrett, Tsang, and Walsh.
Adaptive constraint satisfaction.
In 15th UK Planning and Scheduling Special Interest Group
Workshop, Liverpool, November 1996.
-
[WurtzMuller96]
-
Jörg Würtz and Tobias Müller.
Constructive Disjunction Revisited.
In Proceedings of the twentieth German Annual Conference on
Artificial Intelligence, KI-96, September 1996.
-
[Smith96]
-
Barbara M. Smith.
Succeed-first or Fail-first: A Case Study in Variable and Value
Ordering.
Technical Report 96.26, School of Computer Studies, University of
Leeds, September 1996.
-
[Jampel96]
-
Michael Benjamin Jampel.
Over-Constrained Systems in CLP and CSP.
PhD thesis, September 1996.
-
[Wallace96]
-
Mark G. Wallace.
Constraint Logic Programming: Status and Prospects.
In Proceedings of The Third World Congress on Expert Systems,
pages 13--23, Seoul, August 1996.
-
[MartinShmoys96]
-
Paul Martin and David B. Shmoys.
A New Approach to Computing Optimal Schedules for the Job-Shop
Scheduling Problem.
In W.H. Cunningham, S.T. McCormick, and M. Queyranne, editors,
Proceedings of the 5th International Conference on Integer Programming and
Combinatorial Optimization, IPCO'96, pages 389--403, Vancouver, British
Columbia, Canada, June 1996.
-
[PrcovicEtal96]
-
Nicolas Prcovic, Bertrand Neveu, and Pierre Berlandier.
Distribution de l'Arbre de Recherche des Problèmes de Satisfaction
de Contraintes en Domaines Finis.
In IIéme Conférence Nationale sur la Résolution Pratique
des Problèmes NP-Complets, CNPC'96, Dijon, France, pages 275--290, Mars
1996.
-
[JussienBoizumault96]
-
Narendra Jussien and Patrice Boizumault.
CSP Dynamiques et Relaxation de Contraintes.
In IIéme Conférence Nationale sur la Résolution Pratique
des Problèmes NP-Complets, CNPC'96, Dijon, France, pages 135--149, Mars
1996.
-
[GrantSmith96]
-
Stuart A. Grant and Barbara M. Smith.
The Arc and Path Consistency Phase Transitions.
Technical Report 96.09, School of Computer Studies, University of
Leeds, March 1996.
-
[BlotChabrier96]
-
Isabelle Blot and Jacqueline Chabrier.
Une Nouvelle Approche de Résolution Systématique sur les
Domaines Finis Entiers, Basée sur la Recherche Locale: SCORE(FD/I).
In IIéme Conférence Nationale sur la Résolution Pratique
des Problèmes NP-Complets, CNPC'96, Dijon, France, pages 119--134, Mars
1996.
-
[BenhamouChmeiss96]
-
Belaid Benhamou and Assef Chmeiss.
Dealing with Forward Checking Method in CSP's.
In IIéme Conférence Nationale sur la Résolution Pratique
des Problèmes NP-Complets, CNPC'96, Dijon, France, pages 249--257, Mars
1996.
-
[AffaneHamiche96]
-
M.S. Affane and S. Ould Hamiche.
Consistance de Circuit et Résolution de Problèmes.
In IIéme Conférence Nationale sur la Résolution Pratique
des Problèmes NP-Complets, CNPC'96, Dijon, France, pages 235--248, Mars
1996.
-
[YoshikawaEtal96]
-
Masazumi Yoshikawa, Kazuka Kaneko, Toru Yamanouchi, and Masanobu Watanabe.
A Constraint-Based High School Scheduling System.
IEEE Expert, pages 63--72, February 1996.
-
[LeeLeung96]
-
J. H. M. Lee and H. F. Leung.
Incremental Querying in the Concurrent CLP Language IFD-Constraint
Pandora.
In K. M. George, Janice H. Carroll, Dave Oppenheim, and Jim
Hightower, editors, Proceedings of the 11th Anual Symposium on Applied
Computing, SAC'96, Philadelphia, Pennsylvania, USA, pages 387--392, February
1996.
-
[GentEtal96]
-
Ian P. Gent, Ewen MacIntyre, Patrick Prosser, Barbara M. Smith, and Toby Walsh.
An Empirical Study of Dynamic Variable Ordering Heuristics for the
Constraint Satisfaction Problem.
Technical Report 96.05, School of Computer Studies, University of
Leeds, February 1996.
-
[FruhwirthBrisset96]
-
Thom Frühwirth and Pascal Brisset.
Planning Cordless Business Communication Systems.
IEEE Expert, pages 50--55, February 1996.
-
[ZahnHower96]
-
Martin Zahn and Walter Hower.
Backtracking along with constraint processing and their time
complexities.
Journal of Experimental and Theoretical Artificial
Intelligence, 8:63--74, 1996.
-
[VerfaillieEtal96]
-
Gérard Verfaillie, Michel Lemaitre, and Thomas Schiex.
Russian Doll Search for Solving Constraint Optimization Problems.
In Proceedings of AAAI96, pages 181--187, Portland, Oregon,
USA, 1996.
-
[Verfaillie96]
-
Gérard Verfaillie.
Optimisation Combinatoire et Temps Contraint: quelques leçons
de la théorie et de l'expérience.
In Actes du Colloque INFAUTOM96, Gestion Optimale en Temps
Réel des Grands Moyens de Transport, ENSAE, Toulouse, France, 1996.
-
[SchiexEtal96]
-
Thomas Schiex, Jean-Charles Régin, Christine Gaspin, and Gérard Verfaillie.
Lazy Arc Consistency.
In Proceedings of AAAI96, pages 216--221, Portland, Oregon,
USA, 1996.
-
[SadehFox96]
-
Norman Sadeh and Mark S. Fox.
Variable and value ordering heuristics for the job shop scheduling
constraint satisfaction problem.
Artificial Intelligence, 86:1--41, 1996.
-
[RodosekEtal96]
-
Robert Rodosek, Mark G. Wallace, and Mozafar T. Hajian.
A New Approach to Integrate Mixed Integer Programming with CLP.
In Proceedings Second International Conference on Constraint
ProgrammingWorkshop on Constraint Programming Applications: An Inventory and
Taxonomy, pages 45--54, Cambridge, Massachusetts, 1996.
-
[RichardsRichards96]
-
E. Thomas Richards and Barry Richards.
Nogood Learning for Constraint Satisfaction.
In Proceedings Second International Conference on Constraint
ProgrammingWorkshop on Constraint Programming Applications, 1996.
-
[KwanEtal96]
-
A. Kwan, E.P.K. Tsang, and J.E. Borrett.
Predicting phase transitions of binary CSPs with local graph
topology.
In 12th European Conference on AI, pages 185--189, Budapest,
Hungary, 1996.
-
[Kwan96]
-
A. Kwan.
The validity of normality assumption in CSP research.
In Fourth Pacific Rim International Conference on Artificial
Intelligence (PRICAI), Cairns, Australia, august 1996.
-
[HuangMiles96]
-
Ye Huang and Roger Miles.
Using Case-Based Techniques to Enhance Constraint Satisfaction
Problem Solving.
Applied Artificial Intelligence, 10(4):307--328, july-august
1996.
-
[HenzWurtz96a]
-
Martin Henz and Jörg Würtz.
Using Oz for College Time Tabling.
In E.K.Burke and P.Ross, editors, The Practice and Theory of
Automated Time Tabling: The Selected Proceedings of the 1st International
Conference on the Practice and Theory of Automated Time Tabling, Edinburgh
1995, volume 1153 of Lecture Notes in Computer Science, pages
162--177, 1996.
-
[HenzWurtz96]
-
Martin Henz and Jörg Würtz.
Constraint-Based Time-Tabling-A Case Study.
Applied Artificial Intelligence, 10(5):439--453,
september-october 1996.
-
[HajianEtal96]
-
Mozafar Hajian, Robert Rodosek, and Barry Richards.
Introduction of a New Class of Variables to Discrete and Integer
Programming Problems, 1996.
submitted to Annals of Operational Research.
-
[Fages96]
-
Francois Fages.
Programmation Logique Par Contraintes.
Cours de l'Ecole Polytechnique. Ellipses, Paris, France, 1996.
-
[DechterEtal96]
-
Rina Dechter, Itay Meiri, and Judea Pearl.
Uncovering trees in constraint networks.
Artificial Intelligence, 86, 1996.
-
[ComonEtal96]
-
Hubert Comon, Mehmet Dincbas, Jean-Pierre Jouannaud, and Claude Kirchner.
A Methodological View of Constraint Solving.
Working paper, 1996.
-
[CabonEtal96]
-
B. Cabon, G. Verfaillie, D. Martinez, and P. Bourret.
Using Mean Field Methods for Boosting Backtrack Search in Constraint
Satisfaction Problems.
In Proceedings of ECAI96, Budapest, Hungary, pages 165--169,
1996.
-
[BockmayrKasper96]
-
A. Bockmayr and T. Kasper.
Pseudo-boolean and finite domain constraint programming: A case
study.
In U. Geske and H. Simonis, editors, Deklarative Constraint
Programmierung, Dresden, GMD-Studien Nr. 297, 1996.
-
[BistarelliEtal96]
-
S. Bistarelli, H. Fargier, U. Montanari, F. Rossi, T. Schiex, and
G. Verfaillie.
Semiring-based CSPs and Valued CSPs: Basic Properties and
Comparison.
In M. Jampel, E. Freuder, and M. Maher, editors,
Over-Constrained Systems (Selected papers from the Workshop on
Over-Constrained Systems at CP'95, reprints and background papers), volume
1106 of Lecture Notes in Computer Science, pages 111--150. 1996.
-
[BarthBockmayr96]
-
P. Barth and A. Bockmayr.
Modelling 0-1 problems in CLP(PB).
In Practical Application of Constraint Technology, PACT'96,
London, pages 1--9. The Practical Application Company Ltd, 1996.
-
[Alimonti96]
-
Paola Alimonti.
New local search approximation techniques for maximum generalized
satisfiability problems.
Information Processing Letters, 57:151--158, 1996.
-
[SmithGrant95]
-
Barbara M. Smith and Stuart A. Grant.
Where the Exceptionally Hard Problems Are.
Technical Report 95.35, School of Computer Studies, University of
Leeds, December 1995.
-
[KwanTsang95]
-
A. Kwan and E.P.K. Tsang.
Comparing CSP algorithms without considering variable ordering
heuristics can be misleading.
Technical Report CSM-262, University of Essex, Colchester, UK,
December 1995.
-
[LamounierEtal95]
-
Edgard Lamounier, Terrence Fernando, and Peter M. Dew.
Incremental Constraint Satisfaction for Variational Design Systems.
Technical Report 95.31, School of Computer Studies, University of
Leeds, November 1995.
-
[KirchnerEtal95]
-
Claude Kirchner, Hélène Kirchner, and Marian Vittek.
ELAN, User Manual.
INRIA Lorraine & CRIN, Campus scientifique, 615, rue du Jardin
Botanique, BP-101, 54602 Villers-lès-Nancy Cedex, France, November 1995.
-
[BorrettEtal95]
-
James E. Borrett, Edward P.K. Tsang, and N.R. Walsh.
Adaptive constraint satisfaction: the quickest first principle.
Technical Report CSM-256, University of Essex, Colchester, UK,
November 1995.
-
[GovindarajanEtal95]
-
Kannan Govindarajan, Bharat Jayaraman, and Surya Mantha.
Optimization and Relaxation in Constraint Logic Languages.
Technical Report 95-37, Department of Computer Science, SUNY Buffalo,
October 1995.
-
[BorrettTsang95a]
-
James E. Borrett and Edward P.K. Tsang.
On the selection of constraint satisfaction problem formulations.
Technical Report CSM-254, University of Essex, Colchester, UK,
October 1995.
-
[VoudourisTsang95b]
-
Christos Voudouris and Edward P.K. Tsang.
Partial constraint satisfaction problems and guided local search.
Technical Report CSM-250, Department of Computer Science, University
of Essex, Colchester, UK, September 1995.
-
[VoudourisTsang95]
-
Christos Voudouris and Edward P.K. Tsang.
Function optimizing using guided local search.
Technical Report CSM-249, Department of Computer Science, University
of Essex, Colchester, UK, September 1995.
-
[Paltrinieri95]
-
Massimo Paltrinieri.
A Visual Constraint-Programming Environment.
In Ugo Montanari and Francesca Rossi, editors, Proceedings First
International Conference on Constraint Programming, number 976 in Lecture
Notes in Computer Science, pages 499--514. Springer-Verlag, September 1995.
-
[BorningFreeman-Benson95]
-
Alan Borning and Bjorn N. Freeman-Benson.
The OTI Constraint Solver: A Constraint Library for Constructing
Interactive Graphical User Interfaces.
In Ugo Montanari and Francesca Rossi, editors, Proceedings First
International Conference on Constraint Programming, number 976 in Lecture
Notes in Computer Science, pages 624--628. Springer-Verlag, September 1995.
-
[WallaceFreuder95b]
-
Richard J. Wallace and Eugene C. Freuder.
Anytime algorithms for constraint satisfaction and SAT problems.
In Working Notes of IJCAI-95 Workshop on Anytime Algorithms and
Deliberation Scheduling, Montreal, Canada, August 1995.
-
[WallaceFreuder95a]
-
Richard J. Wallace and Eugene C. Freuder.
Heuristic Methods for Over-Constrained Constraint Satisfaction
Problems.
In Working Notes of CP-95 Workshop on Over Constrained Systems,
Cassis, France, August 1995.
-
[Wallace95b]
-
Richard J. Wallace.
Enhancements of Branch and Bound Methods for the Maximal Constraint
Satisfaction Problem.
In Working Notes of CP-95 Workshop on Over Constrained Systems,
Cassis, France, August 1995.
-
[VoudourisTsang95a]
-
Christos Voudouris and Edward P.K. Tsang.
Guided local search.
Technical Report CSM-247, Department of Computer Science, University
of Essex, Colchester, UK, August 1995.
-
[TsangVoudouris95]
-
Edward P.K. Tsang and Christos Voudouris.
Fast Local Search and Guided Local Search and Their
Application to British Telecom Workforce Scheduling Problem.
Technical Report CSM-246, Department of Computer Science, University
of Essex, Colchester, UK, August 1995.
-
[SabinEtal95a]
-
Daniel Sabin, Mihaela Sabin, Robert D. Russell, and Eugene C. Freuder.
A Constraint-Based Approach to Diagnosing Configuration Problems.
In Sue Abu-Hakima, editor, Working Notes of IJCAI-95 Workshop on
AI in Distributed Information Networks, Montreal, Canada, August 1995.
-
[SabinEtal95]
-
Daniel Sabin, Mihaela Sabin, Robert D. Russell, and Eugene C. Freuder.
A Constraint-Based Approach to Diagnosing Software Problems in
Computer Networks.
In Ugo Montanari and Francesca Rossi, editors, Proceedings First
International Conference on Constraint Programming, Lecture Notes in
Computer Science. Springer-Verlag, August 1995.
-
[JeavonsCohen95]
-
Peter Jeavons and David Cohen.
An Algebraic Characterization of Tractable Constraints.
In Ding-Zhu Du and Ming Li, editors, Proceedings of the First
Annual International Conference on Computing and Combinatorics, COCOON'95,
Xi'an, China, volume 959 of Lecture Notes in Computer Science, pages
633--642, August 1995.
-
[GrantSmith95]
-
Stuart A. Grant and Barbara M. Smith.
The Phase Transition Behaviour of Maintaining Arc Consistency.
Technical Report 95.25, School of Computer Studies, University of
Leeds, August 1995.
-
[FrostDechter95]
-
Daniel Frost and Rina Dechter.
Look-ahead value ordering for constraint satisfaction problems.
In Proceedings of the International Joint Conference on
Artificial Intelligence, IJCAI'95, pages 572--578, Montreal, Canada, August
1995.
-
[FreuderSabin95]
-
Eugene C. Freuder and Daniel Sabin.
Interchangeability Supports Abtraction and Reformulation for
Constraint Satisfaction.
In Proceedings of Symposium on Abstraction, Reformulation and
Approximation, SARA'95, Montreal, Canada, August 1995.
-
[ChopraEtal95]
-
Rajiv Chopra, Rohini Srihari, and Anthony Ralston.
Expensive Constraints and HyperArc Consistency.
Technical Report 95-21, Department of Computer Science, SUNY Buffalo,
May 1995.
-
[Smith95]
-
Barbara M. Smith.
A Tutorial on Constraint Programming.
Technical Report 95.14, School of Computer Studies, University of
Leeds, April 1995.
-
[GovindarajanEtal95b]
-
Kannan Govindarajan, Bharat Jayaraman, and Surya Mantha.
Relaxation in Constraint Logic Programming.
Technical Report 95-22, Department of Computer Science, SUNY Buffalo,
April 1995.
-
[GovindarajanEtal95a]
-
Kannan Govindarajan, Bharat Jayaraman, and Surya Mantha.
Preference Logic Programming: Optimization as Inference.
Technical Report 94-12, Department of Computer Science, SUNY Buffalo,
April 1995.
-
[GentProsser95]
-
Ian P. Gent and Patrick Prosser.
The 50 Research Report 95/180, Department of Computer Science, University of
Strathclyde, April 1995.
-
[SmithEtal95]
-
B.M. Smith, S.C. Brailsford, P.M. Hubbard, and H.P. Williams.
The Progressive Party Problem: Integer Linear Programming and
Constraint Programming Compared.
Technical Report 95.8, School of Computer Studies, University of
Leeds, March 1995.
-
[BorrettTsang95]
-
James E. Borrett and Edward P.K. Tsang.
Observations on the usefulness of arc consistency preprocessing.
Technical Report CSM-236, University of Essex, Colchester, UK, March
1995.
-
[ImbertVanHentenryck95]
-
J.-L. Imbert and Pascal VanHentenryck.
Redundancy Elimination with a Lexicographic Solved Form.
Technical Report CS-95-02, Department of Computer Sciences, Brown
University, February 1995.
-
[WallaceFreuder95]
-
Richard J. Wallace and Eugene C. Freuder.
Comparative studies of constraint satisfaction and Davis-Putnam
algorithms for maximum satisfiability problems.
In D. S. Johnson and M. A. Trick, editors, Cliques, Coloring and
Satisfiability: Second DIMACS Implementation Challenge, Amer. Math. Soc.,
Providence, RI, USA, 1995.
-
[Wallace95a]
-
Mark G. Wallace.
Constraints as a Tool for Distributed Scheduling.
In Proceedings of International Conference on Improving
Manufacture Performance in the Distributed Enterprise: Advanced Systems and
Tools, pages 129--146, Edinburgh, 1995.
-
[Wallace95]
-
Richard J. Wallace.
Directed Arc Consistency Preprocessing.
In Manfred Meyer, editor, Constraint Processing, Selected
Papers, volume 923 of Lecture Notes in Computer Science, pages
121--137. Springer-Verlag, 1995.
-
[VerfaillieSchiex95]
-
Gérard Verfaillie and Thomas Schiex.
Maintien de solution dans les problèmes dynamiques de
satisfaction de contraintes: bilan de quelques approches.
Revue d'Intelligence Artificielle, 9(3):269--309, 1995.
-
[VerfaillieBensana95]
-
Gérard Verfaillie and Eric Bensana.
Optimisation Combinatoire: quelques leçons de la théorie et
de l'expérience.
In Atelier CNES techniques er technologies des segments sols
informatiques, Toulouse, France, Décembre 1995.
-
[TsangEtal95]
-
E. P. K. Tsang, J. E. Borrett, and A. C. M. Kwan.
An attempt to map the performance of a range of algorithm and
heuristic combinations.
In AISB-95, 1995.
-
[SmithGrant95a]
-
B. M. Smith and S. A. Grant.
Sparse constraint graphs and exceptionally hard problems.
In Proc. IJCAI-95, 1995.
-
[Smith95a]
-
Barbara M. Smith.
In Search of Exceptionally Difficult Constraint Satisfaction
Problems.
In Manfred Meyer, editor, Constraint Processing, Selected
Papers, volume 923 of Lecture Notes in Computer Science, pages
139--155. Springer-Verlag, 1995.
-
[SchiexEtal95]
-
Thomas Schiex, Hélène Fargier, and Gérard Verfaillie.
Valued Constraint Satisfaction Problems: Hard and Easy Problems.
In IJCAI'95 Montreal, Canada, 1995.
-
[SadehEtal95]
-
Norman Sadeh, Katia Sycara, and Yalin Xiong.
Backtracking techniques for the job shop scheduling constraint
satisfaction problem.
Artificial Intelligence, 76:455--480, 1995.
-
[Rossi95]
-
Francesca Rossi.
Redundant Hidden Variables in Finite Domain Constraint Problems.
In Manfred Meyer, editor, Constraint Processing, Selected
Papers, volume 923 of Lecture Notes in Computer Science, pages
205--223. Springer-Verlag, 1995.
-
[Rodosek95a]
-
Robert Rodosek.
A Search Control for Scheduling Problems.
In Proceedings of the International Workshop on Artificial
Intelligence in Real-Time Control, pages 182--188, Bled, 1995.
-
[Rodosek95]
-
Robert Rodosek.
Combining Heuristics for Constraint Satisfaction Problems.
In Proceedings First International Conference on Constraint
ProgrammingWorkshop on Studying and Solving Really Hard Problems, pages
147--156, Cassis, 1995.
-
[RichardSaubion95]
-
Gilles Richard and Frédéric Saubion.
Constraint Rewrite Programs: A Way to Evaluate CLP Programs.
In Quatrièmes Journées Francophones de Programmation en
Logique, JFPL'95, pages 35--49, mai 1995.
-
[Prosser95]
-
Patrick Prosser.
Forward Checking with Backmarking.
In Manfred Meyer, editor, Constraint Processing, Selected
Papers, volume 923 of Lecture Notes in Computer Science, pages
185--204. Springer-Verlag, 1995.
-
[PrestwichMudambi95]
-
Steven Prestwich and Shyam Mudambi.
Improved Branch and Bound in Constraint Logic Programming.
In Ugo Montanari and Francesca Rossi, editors, Proceedings First
International Conference on Constraint Programming, Lecture Notes in
Computer Science, pages 533--548. Springer-Verlag, 1995.
-
[MullerWurtz95]
-
Tobias Müller and Jörg Würtz.
Constructive Disjunction in Oz.
In Andreas Krall and Ulrich Geske, editors, 11. Workshop
Logische Programmierung, GMD-Studien, Technische Universität Wien,
27--29September 1995. GMD--Forschungszentrum Informationstechnik GmbH,
D-53754 Sankt Augustin.
-
[MartiRueher95]
-
Philippe Marti and Michel Rueher.
A Distribuited Cooperating Constraints Solving System.
International Journal of Artificial Intelligence Tools,
4(1-2):93--113, 1995.
-
[Manandhar95]
-
Suresh Manandhar.
Deterministic consistency checking of lp constraints.
In Proceedings 7th Conference of the European Chapter of the
ACL, Dublin, Ireland, 1995.
-
[LarrosaMeseguer95]
-
Javier Larrosa and Pedro Meseguer.
Optimization-based Heuristic for Maximal Constraint Satisfaction.
In Ugo Montanari and Francesca Rossi, editors, Proceedings First
International Conference on Constraint Programming, Lecture Notes in
Computer Science, pages 103--120. Springer-Verlag, 1995.
-
[KwanEtal95]
-
A. Kwan, E.P.K. Tsang, and J.E. Borrett.
Phase transition in finding multiple solutions in constraint
satisfaction problems.
In Workshop on Studying and Solving Really Hard Problems, First
International Conference on Principles and Practice of Constraint
Programming, pages 119--126, 1995.
-
[KondrakVan-Beek95]
-
G. Kondrak and P. Van Beek.
A theoretical evaluation of selected backtracking algorithms.
In Proceedings of IJCAI-95, 1995.
-
[Kokeny95]
-
Tibor Kökény.
Constraint Satisfaction Problems with Order-Sorted Domains.
International Journal of Artificial Intelligence Tools,
4(1-2):55--72, 1995.
-
[KirchnerEtal95a]
-
Claude Kirchner, Hélène Kirchner, and Marian Vittek.
Designing Constraint Logic Programming Languages using Computational
Systems.
In Pascal Van Hentenryck and Vijay Saraswat, editors, Principles
and Practice of Constraint Programming. The Newport Papers, pages 131--158.
The MIT press, 1995.
-
[Kirchner95]
-
Hélène Kirchner.
On the Use of Constraints in Automated Deduction.
In A. Podelski, editor, Constraint Programming: Basics and
Trends, volume 910 of Lecture Notes in Computer Science, pages
128--146. Springer-Verlag, 1995.
-
[JeavonsEtal95]
-
Peter Jeavons, David Cohen, and Marc Gyssens.
A Unifying Framework for Tractable Constraints.
In Ugo Montanari and Francesca Rossi, editors, Proceedings First
International Conference on Constraint Programming, Lecture Notes in
Computer Science, pages 276--291. Springer-Verlag, 1995.
-
[HuynhMarriott95]
-
Tien Huynh and Kim Marriott.
Incremental constraint deletion in systems of linear constraints.
Information Processing Letters, 55:111--115, 1995.
-
[Hower95]
-
Walter Hower.
Constraint satisfaction - Algorithms and complexity analysis.
Information Processing Letters, 55:171--178, 1995.
-
[Hentenryck95]
-
Pascal van Hentenryck.
Constraint Solving for Combinatorial Search Problems: A Tutorial.
In Ugo Montanari and Francesca Rossi, editors, Proceedings First
International Conference on Constraint Programming, Lecture Notes in
Computer Science, pages 564--587. Springer-Verlag, 1995.
-
[Goltz95]
-
Hans-Joachim Goltz.
Reducing Domains for Search in CLP(FD) and Its Application to
Job-Shop Scheduling.
In Ugo Montanari and Francesca Rossi, editors, Proceedings First
International Conference on Constraint Programming, Lecture Notes in
Computer Science, pages 549--562. Springer-Verlag, 1995.
-
[Freuder95]
-
Eugene C. Freuder.
Using Metalevel Constraint Knowledge to Reduce Constraint Checking.
In Manfred Meyer, editor, Constraint Processing, Selected
Papers, volume 923 of Lecture Notes in Computer Science, pages
171--184. Springer-Verlag, 1995.
-
[FowlerEtal95]
-
J. Fowler, T. Sola, and F. Fages.
Un Modèle d'Exécution Réactif et Interactif pour la
Programmation Logique avec Constraintes.
In Quatrièmes Journées Francophones de Programmation en
Logique, JFPL'95, pages 21--34, mai 1995.
-
[FerreiraPardalos95]
-
Afonso Ferreira and Panos M. Pardalos.
SCOOP: Solving Combinatorial Optimization Problems in Parallel.
In Afonso Ferreira and Panos Pardalos, editors, Solving
Combinatorial Optimization Problems in Parallel, Lecture Notes in Computer
Science, pages 1--6. Springer-Verlag, 1995.
-
[ErtlKrall95]
-
M. Anton Ertl and Andreas Krall.
High-Level Constraints over Finite Domains.
In Manfred Meyer, editor, Constraint Processing, Selected
Papers, volume 923 of Lecture Notes in Computer Science, pages 51--66.
Springer-Verlag, 1995.
-
[DechterBeek95]
-
Rina Dechter and Peter van Beek.
Local and Global Relational Consistency.
In Ugo Montanari and Francesca Rossi, editors, Proceedings First
International Conference on Constraint Programming, Lecture Notes in
Computer Science, pages 240--257. Springer-Verlag, 1995.
-
[Debruyne95]
-
Romuald Debruyne.
Les algorithmes d'arc-consistance dans les CSP dynamiques.
Revue d'Intelligence Artificielle, 9(3):239--267, 1995.
-
[DavenportTsang95a]
-
A. J. Davenport and E. P. K Tsang.
An empiricial investigation into the exceptionally hard problems.
In Constraint-95 International Workshop on Constraint-Based
Reasoning, Florida AI Research Symposium (FLAIRS-95), pages 46--53, 1995.
-
[DavenportTsang95]
-
A. J. Davenport and Edward P.K. Tsang.
Solving constraint satisfaction sequencing problems by iterative
repair.
Technical Report CSM-238, University of Essex, 1995.
-
[Davenport95a]
-
A. J. Davenport.
A comparison of complete and incomplete algorithms in the easy and
hard regions.
In Studying and Solving Really Hard Problems Workshop, First
International Conference on Principles and Practice of Constraint
Programming, pages 43--51, 1995.
-
[Davenport95]
-
A. J. Davenport.
Iterative repair methods for solving constraint satisfaction
problems.
PhD thesis, University of Essex, 1995.
In preparation.
-
[CorreaFerreira95]
-
Ricardo Corrêa and Alfonso Ferreira.
Parallel Best-First Branch-and-Bound in Discrete Optimization: a
Framework.
In Afonso Ferreira and Panos Pardalos, editors, Solving
Combinatorial Optimization Problems in Parallel, Lecture Notes in Computer
Science, pages 171--200. Springer-Verlag, 1995.
-
[ColussiEtal95]
-
Livio Colussi, Elena Marchiori, and Massimo Marchiori.
On Termination of Constraint Logic Programs.
In Ugo Montanari and Francesca Rossi, editors, Proceedings First
International Conference on Constraint Programming, Lecture Notes in
Computer Science, pages 431--448. Springer-Verlag, 1995.
-
[ChengSmith95]
-
Cheng-Chung Cheng and Stephen F. Smith.
Applying Constraint Satisfaction Techniques to Job Shop Scheduling.
Technical Report CMU-RI-TR-95-03, The Robotics Institute, Carnegie
Mellon University, January 1995.
-
[BrusoniEtal95]
-
Vittorio Brusoni, Luca Console, and Paolo Terenziani.
On the computational complexity of querying bounds on differences
constraints.
Artificial Intelligence, 74:367--379, 1995.
-
[BovetEtal95]
-
D. P. Bovet, A. Clementi, P. Crescenzi, and R. Silvestri.
Parallel Approximation of Optimization Problems.
In Afonso Ferreira and Panos Pardalos, editors, Solving
Combinatorial Optimization Problems in Parallel, Lecture Notes in Computer
Science, pages 7--24. Springer-Verlag, 1995.
-
[Bockmayr95]
-
A. Bockmayr.
Solving pseudo-boolean constraints.
In Constraint Programming: Basics and Trends. Springer, LNCS
910, 1995.
-
[BessiereRegin95]
-
Christian Bessière and Jean-Charles Régin.
Using Bidirectionality to Speed Up Arc-Consistency Processing.
In Manfred Meyer, editor, Constraint Processing, Selected
Papers, volume 923 of Lecture Notes in Computer Science, pages
157--169. Springer-Verlag, 1995.
-
[Berlandier95]
-
Pierre Berlandier.
Filtrage de problèmes par consistance de chemin restreinte.
Revue d'Intelligence Artificielle, 9(3):225--238, 1995.
-
[BenhamouTouraivane95]
-
Frédéric Benhamou and Touraïvane.
Prolog IV: Langage et Algorithmes.
In Quatrièmes Journées Francophones de Programmation en
Logique, JFPL'95, pages 51--65, mai 1995.
-
[BellichaEtal95]
-
Amit Bellicha, Bertrand Neveu, Brigitte Trousse, Christian Bessière,
Christine Gaspin, David Lesaint, Fabrice Bouquet, Florence Dupin
de Saint-Cyr, Gilles Trombettoni, Gérard Verfaillie, Hélène Fargier,
Jean-Claude Régin, Jean-Pierre Rellier, Jŕome Amilhastre, Jŕome Lang,
Khaled Ghedira, Marie-Catherine Vilarem, Martin Cooper, Mouhssine Bouzoubaa,
Olivier Lhomme, Philippe Charman, Philippe David, Philippe Janssen, Philippe
Jégou, Pierre Berlandier, Roder Martin-Clouaire, Thomas Schiex, and Tibor
Kökény.
Autour du problème de satisfaction de contraintes.
In Actes des 5ièmes journées nationales du PRC-GDR
Intelligence Artificielle, Nancy, France, Février 1995.
Groupe PRCIA Représentation et traitement de la flexibilité
dans les problèmes sous contraintes.
-
[BarthBockmayr95a]
-
P. Barth and A. Bockmayr.
Finite Domain and Cutting Plane Techniques in CLP(PB).
In Logic Programming, 12th International Conference, ICLP'95,
Kanagawa, Japan, pages 133--147. MIT Press, 1995.
-
[BarthBockmayr95]
-
P. Barth and A. Bockmayr.
Modelling Mixed-Integer Optimisation Problems in Constraint Logic
Programming.
Technical Report MPI-I-95-2-011, Max Planck Institut für
Informatik, Saarbruecken, 1995.
-
[Baker95]
-
A. Baker.
Intelligent Backtracking.
PhD thesis, Computational Intelligence Research Laboratory,
University of Oregon, 1995.
-
[BacchusVan-Run95]
-
F. Bacchus and P. Van Run.
Dynamic variable ordering in CSPs.
In Proceedings of Principles and Practice of Constraint
Programming, 1995.
To appear.
-
[BacchusRun95]
-
Fahiem Bacchus and Paul van Run.
Dynamic Variable Ordering in CSPs.
In Ugo Montanari and Francesca Rossi, editors, Proceedings First
International Conference on Constraint Programming, Lecture Notes in
Computer Science, pages 258--275. Springer-Verlag, 1995.
-
[BacchusGrove95]
-
Fahiem Bacchus and Adam Grove.
On the Forward Checking Algorithm.
In Ugo Montanari and Francesca Rossi, editors, Proceedings First
International Conference on Constraint Programming, Lecture Notes in
Computer Science, pages 292--309. Springer-Verlag, 1995.
-
[SabinEtal94]
-
Daniel Sabin, Mihaela C. Sabin, Robert D. Russell, and Eugene C. Freuder.
A Constraint-Based Approach to Diagnosing Distributed Software
Systems.
In Gregory M. Provan, editor, Working papers of the 5th
International Workshop on Principles of Diagnosis (DX), New Paltz, NY, USA,
October 1994.
-
[Prosser94b]
-
P. Prosser.
Exceptionally hard problems.
USENET Article 3473dh$27c@@todd-06.cs.strath.ac.uk,
comp.constraints, September 1994.
-
[Paltrinieri94]
-
Massimo Paltrinieri.
Integrating Objects with Constraint-Programming Languages.
In Elisa Bertino and Susan Urban, editors, Proceedings of the
International Symposium on Object-Oriented Methodologies and Systems, ISOOMS
'94, Palermo, Italy, volume 858 of Lecture Notes in Computer Science,
pages 248--265, September 1994.
-
[FrostDechter94]
-
Daniel Frost and Rina Dechter.
In search of the best constraint satisfaction search.
In National Conference of Artificial Intelligence, AAAI-94,
Seattle, WA, USA, August 1994.
-
[GentWalsh94b]
-
Ian P. Gent and Toby Walsh.
How Not To Do It.
Research Paper 714, Department of Artificial Intelligence,
University of Edinburgh, July 1994.
-
[Michaylov94]
-
Spiro Michaylov.
Repeated Redundancy Inequalities in Constraint Logic Programming.
Technical Report OSU-CISRC-6/94-TR31, Department of Computer and
Information Sciences, The Ohio State University, June 1994.
-
[GentWalsh94e]
-
Ian P. Gent and Toby Walsh.
The Satisfiability Constraint Gap.
Research Paper 702, Department of Artificial Intelligence,
University of Edinburgh, June 1994.
-
[Smith94c]
-
B. M. Smith.
Locating the phase transistion in binary constraint satisfaction
problems.
Technical Report 94.16, Division of Artificial Intelligence,
University of Leeds, May 1994.
To appear in AI Journal.
-
[SabinFreuder94]
-
Daniel Sabin and Eugene C. Freuder.
Contradicting Conventional Wisdom in Constraint Satisfaction.
In Alan Borning, editor, Proceedings of the Second International
Workshop on Principles and Practice of Constraint Programming, PPCP'94,
Rosario, Orcas Island, Washington, USA, volume 874 of Lecture Notes in
Computer Science, pages 10--20, May 1994.
-
[Paltrinieri94a]
-
Massimo Paltrinieri.
On the Design of Constraint Satisfaction Problems.
In Alan Borning, editor, Proceedings of the Second International
Workshop on Principles and Practice of Constraint Programming, PPCP'94,
Rosario, Orcas Island, Washington, USA, volume 874 of Lecture Notes in
Computer Science, pages 299--311, May 1994.
-
[LadkinMaddux94]
-
Peter B. Ladkin and Roger D. Maddux.
On Binary Constraint Problems.
Journal of the ACM, 41(3):435--469, May 1994.
-
[JeavonsEtal94]
-
Peter Jeavons, David Cohen, and Martin Cooper.
A Substitution Operation for Constraints.
In Alan Borning, editor, Proceedings of the Second International
Workshop on Principles and Practice of Constraint Programming, PPCP'94,
Rosario, Orcas Island, Washington, USA, volume 874 of Lecture Notes in
Computer Science, pages 1--9, May 1994.
-
[JaffarEtal94]
-
Joxan Jaffar, Michael J. Maher, Peter J. Stuckey, and H. C. Yap.
Beyond Finite Domains.
In Alan Borning, editor, Proceedings of the Second International
Workshop on Principles and Practice of Constraint Programming, PPCP'94,
Rosario, Orcas Island, Washington, USA, volume 874 of Lecture Notes in
Computer Science, pages 86--94, May 1994.
-
[Hooker94]
-
J. N. Hooker.
Logic-Based Methods for Optimization.
In Alan Borning, editor, Proceedings of the Second International
Workshop on Principles and Practice of Constraint Programming, PPCP'94,
Rosario, Orcas Island, Washington, USA, volume 874 of Lecture Notes in
Computer Science, pages 336--349, May 1994.
-
[HentenryckEtal94]
-
Pascal van Hentenryck, Vijay Saraswat, and Yves Deville.
Design, Implementation, and Evaluation of the Constraint Language
cc(FD).
In Constraint Programming: Basic and Trends. Selected Papers of
the 22nd Spring School in Theoretical Computer Sciences. Springer-Verlag,
Châtillon-sur-Seine, France, May 1994.
-
[Fruhwirth94]
-
Thom Frühwirth.
Constraint Handling Rules.
In Andreas Podelski, editor, Constraint Programming: Basic and
Trends. Selected Papers of the 22nd Spring School in Theoretical Computer
Sciences, volume 910 of Lecture Notes in Computer Science, pages
90--107. Springer-Verlag, Châtillon-sur-Seine, France, May 1994.
-
[BenhamouEtal94]
-
F. Benhamou, D. McAllester, and P. van Hentenryck.
CLP(Intervals) Revisited.
Technical Report CS-94-18, Department of Computer Sciences, Brown
University, April 1994.
-
[Bockmayr94]
-
A. Bockmayr.
Cutting planes in constraint logic programming.
Technical Report MPI-I-94-207, Max Planck Institut für
Informatik, Saarbruecken, February 1994.
-
[WarwickTsang94]
-
T. Warwick and E. P. K. Tsang.
Using a genetic algorithm algorithm to tackle the processors
configuration problem.
In Proc. ACM Symposium on Applied Computing (SAC), pages
217--221, 1994.
-
[Wallace94]
-
Mark G. Wallace.
Applying Constraints For Scheduling.
In Mayoh B and Penjaam J, editors, Constraint Programming, NATO
ASI Series. Springer-Verlag, 1994.
-
[VoudourisTsang94]
-
Christos Voudouris and Edward P.K. Tsang.
The tunneling algorithm for partial CSPs and combinatorial
optimization problems.
Technical Report CSM-213, Department of Computer Science, University
of Essex, Colchester, UK, 1994.
-
[VerfaillieSchiex94a]
-
Gérard Verfaillie and Thomas Schiex.
Solution reuse in dynamic constraint satisfaction problems.
In Proceedings of the Twelfth Conference of the American
Association of Artificial Intelligence, pages 307--312, 1994.
-
[VerfaillieSchiex94]
-
Gérard Verfaillie and Thomas Schiex.
Dynamic backtracking for dynamic constraint satisfaction problems.
In Proceedings of the European Conference on Artificial
Intelligence Workshop on “Constraint Satisfaction Issues Raised by Practical
Applications”, 1994.
-
[Smith94b]
-
Barbara M. Smith.
In Search of Exceptionally Difficult Constraint Satisfaction
Problems.
Technical Report 94.2, School of Computer Studies, University of
Leeds, 1994.
-
[Smith94a]
-
B. M. Smith.
Phase transistion and the mushy region in constraint satisfaction
problems.
In 11th European Conference on Artificial Intelligence, pages
100--104, 1994.
-
[Smith94]
-
B. M. Smith.
In search of exceptionally difficult constraint satisfaction
problems.
In 11th European Conference on Artificial Intelligence, Workshop
on Constraint Processing, pages 79--86, 1994.
-
[SelmanEtal94]
-
B. Selman, H. A. Kautz, and B. Cohen.
Noise strategies for improving local search.
In Proc, 12th National Conference on Artificial Intelligence,
volume 1, pages 337--343. The American Association for Artificial
Intelligence, AAAI Press/The MIT Press, 1994.
-
[SchiexVerfaillie94a]
-
Thomas Schiex and Gérard Verfaillie.
Nogood recording for static and dynamic constraint satisfaction
problems.
International Journal on Artificial Intelligence Tools,
3(2):187--207, 1994.
-
[SchiexVerfaillie94]
-
Thomas Schiex and Gérard Verfaillie.
Nogood Recording for Static and Dynamic Constraint Satisfaction
Problem.
International Journal of Artificial Intelligence Tools,
3(2):187--207, 1994.
-
[Rodosek94a]
-
Robert Rodosek.
Reducing Disjunctive Precedence Constraints Based on Symmetry.
In Proceedings of the 11th European Conference on Artificial
Intelligence, ECAI'94Workshop on Constraint Satisfaction Issues Raised by
Practical Applications, pages 31--38, Amsterdam, 1994.
-
[Rodosek94]
-
Robert Rodosek.
Combining Constraint Network and Causal Theory to Solve Scheduling
Problems from a CSP Perspective.
In Proceedings of the 11th European Conference on Artificial
Intelligence, ECAI'94, pages 630--634, Amsterdam, 1994.
-
[Regin94]
-
J. Régin.
A filtering algorithm for constraints of difference in CSPs.
In Proceedings of AAAI-94, volume 1, pages 362--367, 1994.
-
[Prosser94a]
-
P. Prosser.
Binary constraint satisfaction problems: Some are harder than others.
In 11th European Conference on Artificial Intelligence, pages
95--99, 1994.
-
[Prosser94]
-
P. Prosser.
Forward checking with backmarking.
In 11th European Conference on Artificial Intelligence, Workshop
on Constraint Processing, pages 59--68, 1994.
-
[Papadimitriou94]
-
C. M. Papadimitriou.
Computational Complexity.
Addison-Wesley, 1994.
-
[Mitchell94]
-
D. G. Mitchell.
Respecting your data (I).
In AAAI-94 Workshop on Experimental Evaluation of Reasoning
and Search Methods, 1994.
-
[Liu94]
-
Bing Liu.
Specific Constraint Handling in Constraint Satisfaction Problems.
International Journal of Artificial Intelligence Tools,
3(1):79--96, 1994.
-
[Konolige94]
-
K. Konolige.
Easy to be hard: Difficult problems for greedy algorithms.
In J. Doyle, E. Sandewall, and P. Torasso, editors, Principles
of Knowledge Representation and Reasoning, pages 374--378. Morgan-Kaufmann,
1994.
-
[JohnstonMinton94]
-
M. D. Johnston and S. Minton.
Intelligent Scheduling, chapter Analyzing a Heuristic Strategy
for Constraint Satisfaction Scheduling, pages 257--289.
Morgan Kaufmann, 1994.
-
[JiangEtal94]
-
Yuejun Jiang, Thomas Richards, and Barry Richards.
No-good backmarking with min-conflicts repair in constraint
satisfaction and optimization.
In Principles and Practice of Constraint Programming 94;
reprinted in Principles and Practice of Constraint Programming 94, pages
21--39, 1994.
-
[JaffarMaher94]
-
J. Jaffar and M. J. Maher.
Constraint Logic Programming: A Survey.
Journal of Logic Programming, 19(20):503--581, 1994.
-
[HoggWilliams94]
-
T. Hogg and C.P. Williams.
The hardest constraint problems: A double phase transistion.
Artificial Intelligence, 69:359--377, 1994.
-
[GyssensEtal94]
-
Marc Gyssens, Peter G. Jeavons, and David A. Cohen.
Decomposition constraint satisfaction problems using database
techniques.
Artificial Intelligence, 66:57--89, 1994.
-
[GuEtal94]
-
Jun Gu, Xiaofei Huang, and Bin Du.
A Quantitative Solution to Constraint Satisfaction Problem (CSP).
New Generation Computing, 13:99--115, 1994.
-
[Ghedira94]
-
K. Ghedira.
Dynamic partial constraint satisfaction by multi-agent and simulated
annealing.
In Workshop on Constraint Satisfaction Issues Raised by
Practical Applications, 11th European Conference on Artificial Intelligence,
1994.
-
[GentWalsh94g]
-
I.P. Gent and T. Walsh.
The hardest random SAT problems.
In B. Nebel and L. Dreschler-Fischer, editors, KI-94: Advances
in Artificial Intelligence. 18th German Annual Conference on Artificial
Intelligence, pages 355--366. Springer-Verlag, 1994.
-
[GentWalsh94f]
-
I.P. Gent and T. Walsh.
Easy problems are sometimes hard.
Artificial Intelligence, 70:335--345, 1994.
-
[GentWalsh94d]
-
Ian P. Gent and Toby Walsh.
The SAT Phase Transition.
Research Paper 679, Department of Artificial Intelligence,
University of Edinburgh, January 1994.
-
[GentWalsh94c]
-
Ian P. Gent and Toby Walsh.
The Hardest Random SAT Problem.
Research Paper 680, Department of Artificial Intelligence,
University of Edinburgh, January 1994.
-
[GentWalsh94a]
-
I. P. Gent and T. Walsh.
Computational phase transistions in real problems.
Technical Report 724, Department of Artificial Intelligence,
Universirty of Edinburgh, 1994.
-
[GentWalsh94]
-
I. P. Gent and T. Walsh.
The SAT phase transistion.
In 11th European Conference on Artificial Intelligence, Workshop
on Constraint Processing, pages 105--109, 1994.
-
[Fron94]
-
Annick Fron.
Programmation Par Contraintes.
Addison-Wesley Publishing Company, 1994.
-
[Freuder94]
-
E. C. Freuder.
Using Metalevel Constraint Knowledge to Reduce Constraint Checking.
In Proceedings of the Workshop on Constraint Processing,
ECAI'94, Amsterdam, The Netherlands, pages 27--33, 1994.
-
[Faltings94]
-
Boi Faltings.
Arc-consistency for continuous variables.
Artificial Intelligence, 65:363--376, 1994.
-
[DavenportEtal94]
-
Andrew J. Davenport, Edward P.K. Tsang, C. J. Wang, and K. Zhu.
GENET: A connectionist architecture for solving constraint
satisfaction problems by iterative improvement.
In Proceedings of the 12th National Conference on Artificial
Intelligence, volume 1, pages 325--330. AAAI Press/MIT Press, 1994.
-
[CrawfordBaker94]
-
J. M. Crawford and A. B. Baker.
Experimental results on the application of satisfiability algorithms
to scheduling problems.
In Proc, 12th National Conference on Artificial Intelligence,
volume 2, pages 1092--1097, 1994.
-
[CooperEtal94]
-
Martin C. Cooper, David A. Cohen, and Peter G. Jeavons.
Characterising tractable constraints.
Artificial Intelligence, 65:347--361, 1994.
-
[CaseauLaburthe94]
-
Yves Caseau and Francois Laburthe.
Improved CLP Scheduling with Task Intervals.
In Pascal van Hentenryck, editor, Proceedings of the 11th
International Conference on Logic Programming, ICLP'94. The MIT press, 1994.
-
[BessiereRegin94a]
-
Christian Bessière and Jean-Charles Régin.
An arc-consistency algorithm optimal in the number of constraint
checks.
In Proceedings of the Workshop on Constraint Processing,
ECAI'94, Amsterdam, The Netherlands, pages 9--16, 1994.
-
[BessiereRegin94]
-
Christian Bessière and Jean-Charles Régin.
MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on
Hard Problems.
In Proceedings Second International Conference on Constraint
Programming, pages 61--75, Cambridge, MA, USA, 1994.
-
[Bessiere94a]
-
Christian Bessière.
Arc-consistency and arc-consistency again.
Artificial Intelligence, 65:179--190, 1994.
-
[Bessiere94]
-
C. Bessière.
A fast algorithm to establish arc-consistency in constraint
networks.
Technical Report TR-94-003, LIRMM Université de Montpellier II,
January 1994.
-
[BarthBockmayr94]
-
P. Barth and A. Bockmayr.
Finite Domain and Cutting Plane Techniques in CLP(PB).
Technical Report MPI-I-94-261, Max Planck Institut für
Informatik, Saarbruecken, 1994.
-
[JourdanSola93]
-
Jean Jourdan and Thierry Sola.
The Versatility of Handling Disjunctions as Constraints.
In Maurice Bruynooghe and Jaan Penjam, editors, Proceedings of
the 5th International Symposium on Programming Language Implementation and
Logic Programming, PLILP'93, Tallinn, Estonia, number 714 in Lecture Notes
in Computer Science, pages 60--74. Springer-Verlag, August 1993.
-
[KwanRahin93]
-
Raymond S.K. Kwan and Mohammad A. Rahin.
Bus Scheduling with Trip Coordination and Complex Constraints.
Technical Report 93.23, School of Computer Studies, University of
Leeds, June 1993.
-
[GentWalsh93]
-
Ian P. Gent and Toby Walsh.
Easy Problems are Sometimes Hard.
Research Paper 642, Department of Artificial Intelligence,
University of Edinburgh, June 1993.
-
[SannellaEtal93]
-
Michael Sannella, John Maloney, Bjorn Freeman-Benson, and Alan Borning.
Multi-way versus One-way Constraints in User Interfaces: Experience
with the DeltaBlue Algorithm.
Software - Practice and Experience, 23(5):529--566, May 1993.
Preprint published as Technical Report 92-07-05, University of
Washington.
-
[Smith93]
-
Barbara M. Smith.
Experiments with a Reassignment Heuristic for Large Constraint
Satisfaction Problems.
Technical Report 93.9, School of Computer Studies, University of
Leeds, February 1993.
-
[LuoEtal93]
-
Q. Luo, P. Hendry, and J. Buchanan.
Heuristic search for distributed constraint satisfaction problems.
Technical Report KEG-6-93, University of Strathclyde, UK, February
1993.
-
[ZwebenEtal93]
-
M. Zweben, E. Davis, B. Daun, and M. Deale.
Informedness vs. computational cost of heuristics in iterative repair
scheduling.
In Proceedings of the 13th International Joint Conference on
Artificial Intelligence, 1993.
-
[Wallace93]
-
Richard J. Wallace.
Why AC-3 is almost always better than AC-4 for establishing arc
concsistency in CSPs.
In Proceedings 13th International Joint Conference on Artificial
Intelligence, Chambéry (France), pages 239--245, 1993.
-
[TsangKwan93]
-
E. P. K. Tsang and A Kwan.
Mapping constraint satisfaction problems to algorithms and
heuristics.
Technical Report CSM-198, University of Essex, 1993.
-
[Tsang93]
-
Edward Tsang.
Foundations of Constraint Satisfaction.
Academic Press, London, 1993.
-
[Taillard93]
-
E. Taillard.
Benchmarks for basic scheduling problems.
European Journal of Operations Research, 64:278--285, 1993.
-
[Smith93a]
-
Barbara M. Smith.
The Phase Transition in Constraint Satisfaction Problems: A Closer
Look at the Mushy Region.
Technical Report 93.41, School of Computer Studies, University of
Leeds, 1993.
-
[SelmanKautz93]
-
B. Selman and H.A. Kautz.
Domain independent extensions to GSAT: Solving large structured
satisfiability problems.
In Proceedings of IJCAI-93, 1993.
-
[Rodosek93]
-
Robert Rodosek.
Constraint Satisfaction Problem as a Causal Theory, 1993.
NATO Advanced Study Institute Constraint Programming, CS 57/93,
Institute of Cybernetics, Tallin, pp 167-182.
-
[ProvostWallace93]
-
Thierry Le Provost and Mark Wallace.
Generalized Constraint Propagation Over the CLP Scheme.
Journal of Logic Programming, 16:319--359, 1993.
-
[Prosser93a]
-
P. Prosser.
Domain filtering can degrade intelligent backtracking search.
In Proceedings of the 13th International Joint Conference on
Artificial Intelligence, volume 1, pages 262--267. Morgan Kaufmann, 1993.
Original conflict-directed backjumping reference.
-
[Prosser93]
-
P. Prosser.
Hybrid algorithms for the constraint satisfaction problem.
Computational Intelligence, 9(3):268--299, 1993.
-
[Morris93]
-
P. Morris.
The breakout method for escaping from local minima.
In Proc, 11th National Conference on Artificial Intelligence.
The American Association for Artificial Intelligence, AAAI Press/The MIT
Press, 1993.
-
[MontanariRossi93]
-
Ugo Montanari and Francesca Rossi.
Finite Domain Constraint Solving and Constraint Logic Programming.
In Frédéric Benhamou and Alain Colmerauer, editors,
Constraint Logic Programming: Selected Research, pages 201--221. The MIT
press, 1993.
-
[Massat93]
-
Jean-Luc Massat.
Using Local Consistency Techniques to Solve Boolean Constraints.
In Frédéric Benhamou and Alain Colmerauer, editors,
Constraint Logic Programming: Selected Research, pages 223--235. The MIT
press, 1993.
-
[MackworthFreuder93]
-
Alan K. Mackworth and Eugene C. Freuder.
The complexity of constraint satisfaction revisited.
Artificial Intelligence, 59:57--62, 1993.
-
[LassezEtal93]
-
Jean-Louis Lassez, Tien Huynh, and Ken McAloon.
Simplification and Elimination of Redundant Linear Arithmetic
Constraints.
In Frédéric Benhamou and Alain Colmerauer, editors,
Constraint Logic Programming: Selected Research, pages 73--87. The MIT
press, 1993.
-
[Kuip93]
-
C.A.C. Kuip.
Algebraic Languages for Mathematical Programming.
European Journal of Operations Research, 67:25--51, 1993.
-
[ImbertHentenryck93]
-
Jean-Louis Imbert and Pascal van Hentenryck.
On the Handling of Disequations in CLP over Linear Rational
Arithmetic.
In Frédéric Benhamou and Alain Colmerauer, editors,
Constraint Logic Programming: Selected Research, pages 49--71. The MIT
press, 1993.
-
[Hooker93]
-
J. N. Hooker.
Needed: An empirical science of algorithms.
Technical report, Graduate School of Industrial Administration,
Carnegie Mellon University, 1993.
Available by ftp from: dimacs.rutgers.edu in
pub/challenge.contributed/hooker.
-
[HentenryckEtal93]
-
Pascal van Hentenryck, Vijay Saraswat, and Yves Deville.
Design, Implementation, and Evaluation of the Constraint Language
cc(FD).
Technical Report CS-93-02, Department of Computer Sciences, Brown
University, January 1993.
-
[Ginsberg93]
-
Matthew Ginsberg.
Dynamic backtracking.
Journal of Artificial Intelligence Research, pages 25--46,
1993.
-
[FruhwirthEtal93]
-
Tom Frühwirth, Alexander Herold, Volker Küchenhoff, Thierry Le
Provost, Pierre Lim, Eric Monfroy, and Mark Wallace.
Constraint logic programming -- an informal introduction.
Technical report ECRC-93-5, European Computer-Industry Research
Center, München, 1993.
-
[FreuderHubbe93]
-
E. C. Freuder and P. D. Hubbe.
Using inferred disjunctive constraints to decompose constraint
satisfaction problems.
In Proceedings of IJCAI-93, pages 254--260, 1993.
-
[CrawfordAuton93]
-
J. M. Crawford and L. D. Auton.
Experimental results on the crossover point in satisfiability
problems.
In Proceedings of the Eleventh National Conference on Artificial
Intelligence, pages 21--27, 1993.
-
[Charman93]
-
Phillipe Charman.
Solving space planning problems using constraint technology.
In M. Meyer, editor, Constraint Processing. Proceedings of the
International Workshop at CSAM '93, pages 159--172. DFKI
Saarbrücken, 1993.
-
[Bockmayr93]
-
Alexander Bockmayr.
Logic Programming with Pesudo-Boolean Constraints.
In Frédéric Benhamou and Alain Colmerauer, editors,
Constraint Logic Programming - Selected Research, chapter 18, pages
327--350. The MIT press, 1993.
-
[BennaceurPlateau93]
-
Hachemi Bennaceur and Gérard Plateau.
An exact algorithm for the constraint satisfaction problem:
Application to logical inference.
Information Processing Letters, 48:151--158, 1993.
-
[Bellicha93]
-
Amit Bellicha.
Maintenance of a solution in a dynamic constraint satisfaction
problem.
Applications of Artificial Intelligence in Engineering, pages
261--274, 1993.
-
[BarthBockmayr93]
-
P. Barth and A. Bockmayr.
Solving 0-1 Problems in CLP(PB).
In Proc. 9th Conf. Artificial Intelligence for Applications
CAIA, Orlando, Florida, pages 263--269. IEEE, 1993.
-
[Sogno92]
-
Jean-Claude Sogno.
Analysis of Standard and New Algorithms for the Integer and Linear
Constraint Satisfaction Problem.
Rapport de Recherche 1828, Institut National de Recherche
en Informatique et Automatique, December 1992.
-
[dAndrea92]
-
Michel d'Andrea.
Scheduling and Optimisation in the Automobile Industry.
In G. Comyn, N. E. Fuchs, and M. J. Ratcliffe, editors, Second
International Logic Programming Summer School, LPSS'92, volume 636 of
Lecture Notes in Artificial Intelligence, pages 36--44. Springer-Verlag,
September 1992.
-
[FruhwirthEtal92]
-
Thom Frühwirth, Alexander Herold, Volker Küchenhoff, Thierry Le
Provost, Pierre Lim, Eric Monfroy, and Mark Wallace.
Constraint Logic Programming: An Informal Introduction.
In G. Comyn, N. E. Fuchs, and M. J. Ratcliffe, editors, Second
International Logic Programming Summer School, LPSS'92, volume 636 of
Lecture Notes in Artificial Intelligence, pages 3--35. Springer-Verlag,
September 1992.
-
[Evans92]
-
Owen V. Evans.
Factory scheduling using Finite Domains.
In G. Comyn, N. E. Fuchs, and M. J. Ratcliffe, editors, Second
International Logic Programming Summer School, LPSS'92, volume 636 of
Lecture Notes in Artificial Intelligence, pages 45--53. Springer-Verlag,
September 1992.
-
[Blake92]
-
Ben A. Blake.
Assignment of Independent Tasks to Minimize Completion Time.
Software - Practice and Experience, 22(9):723--734, September
1992.
-
[DechterItai92]
-
Rina Dechter and Alon Itai.
Finding All Solutions If You Can Find One.
In Presented in the Workshop on Tractable Reasoning, AAAI-92,
pages 35--39, San Jose, CA, USA, July 1992.
-
[ZhangMackworth92]
-
Y. Zhang and A. K. Mackworth.
Parallel and distributed finite constraint satisfaction.
Technical Report 92-30, Department of Computer Science, University of
British Columbia, Vancouver, B. C. Canada, 1992.
-
[WangTsang92]
-
C.J. Wang and Edward P.K. Tsang.
A sascadable VLSI design for GENET.
In International Workshop on VLSI for Neural Networks and
Artificial Intelligence, Oxford, 1992.
-
[Vempaty92]
-
Nageshwara Rao Vempaty.
Solving constraint satisfaction problems using finite state automata.
In Proceedings of the Tenth National Conference on Artificial
Intelligence, pages 453--458, 1992.
-
[SelmanEtal92]
-
B. Selman, H. Levesque, and H.A. Kautz.
A new method for solving hard satisfiability problems.
In Proc, 10th National Conference on Artificial Intelligence.
The American Association for Artificial Intelligence, AAAI Press/MIT Press,
1992.
-
[PressEtal92]
-
W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery.
Numerical Recipes in C.
Cambridge University Press, 2nd edition, 1992.
-
[Perlin92]
-
Mark Perlin.
Arc consistency for factorable relations.
Artificial Intelligence, 53:329--342, 1992.
-
[MusickRussell92]
-
R. Musick and S. Russell.
How long will it take ?
In Proc, 10th National Conference on Artificial Intelligence,
volume 1, pages 466--471. The American Association for Artificial
Intelligence, AAAI Press/The MIT Press, 1992.
-
[Morris92]
-
P. Morris.
On the density of solutions in equilibrium points for the queens
problem.
In Proc, 10th National Conference on Artificial Intelligence,
volume 1, pages 428--433. The American Association for Artificial
Intelligence, AAAI Press/The MIT Press, 1992.
-
[MitchellEtal92]
-
D. Mitchell, B. Selman, and H. Levesque.
Hard and easy distributions of SAT problems.
In Proc, 10th National Conference on Artificial Intelligence,
pages 459--465, 1992.
-
[MintonEtal92a]
-
Steven Minton, Mark D. Jonston, Andrew B. Philips, and Philip Laird.
Minimizing conflicts: a heuristic repair method for constraint
satisfaction and scheduling problems.
Artificial Intelligence, 58:161--205, 1992.
-
[MintonEtal92]
-
S. Minton, M. Johnston, A.B. Philips, and P. Laird.
Minimizing conflicts: a heuristic repair method for constraint
satisfaction and scheduling problems.
Artificial Intelligence, 58:161--205, 1992.
-
[Meseguer92]
-
José Meseguer.
Conditional rewriting logic as a unified model of concurrency.
Theoretical Computer Science, 96(1):73--155, 1992.
-
[Mackworth92a]
-
Alan K. Mackworth.
Constraint Satisfaction.
In Stuart C. Shapiro, editor, Encyclopedia of Artificial
Intelligence, volume 1. Addison-Wesley Publishing Company, 1992.
Second Edition.
-
[Mackworth92]
-
Alan K. Mackworth.
The logic of constraint satisfaction.
Artificial Intelligence, 58:3--20, 1992.
-
[LassezMcAloon92]
-
Jean-Louis Lassez and Ken McAloon.
A Canonical Form for Generalized Linear Constraints.
Journal of Symbolic Computation, 13:1--24, 1992.
-
[Kumar92a]
-
Vipin Kumar.
Algorithms for Constraint-Satisfaction Problems: A Survey.
Artificial Intelligence Magazine, 13(1):32--44, Spring 1992.
-
[Kumar92]
-
Vipin Kumar.
Algorithms for constraint satisfaction problems: A survey.
AI Magazine, 13(1):32--44, 1992.
-
[KautzSelman92]
-
H. Kautz and B. Selman.
Planning as satisfiability.
In Proceedings of the 10th European Conference on Artificial
Intelligence (ECAI-92), 1992.
-
[HentenryckSimonis92]
-
Pascal van Hentenryck and Helmut Simonis.
Constraint satisfcation using constraint logic programming.
Artificial Intelligence, 58:113--159, 1992.
-
[HentenryckGraf92]
-
Pascal van Hentenryck and Thomas Graf.
Standard forms for rational linear arithmetic in constraint logic
programming.
Annals of Mathematics and Artificial Intelligence, 5:303--319,
1992.
-
[HentenryckEtal92]
-
Pascal van Hentenryck, Yves Deville, and Choh-Man Teng.
A generic arc-consistency algorithm and its specializations.
Artificial Intelligence, 57:291--321, 1992.
-
[FreuderWallace92a]
-
Eugene C. Freuder and Richard J. Wallace.
Partial constraint satisfaction.
Artificial Intelligence, 58:21--70, 1992.
-
[FreuderWallace92]
-
E. C. Freuder and R. J. Wallace.
Partial constraint satisfaction.
Artificial Intelligence Journal, 58:21--70, 1992.
-
[Dechter92a]
-
Rina Dechter.
Constraint Networks.
In Stuart C. Shapiro, editor, Encyclopedia of Artificial
Intelligence, volume 1. Addison-Wesley Publishing Company, 1992.
Second Edition.
-
[Dechter92]
-
Rina Dechter.
From local to global consistency.
Artificial Intelligence, 55:87--107, 1992.
-
[CooperSwain92]
-
Paul R. Cooper and Michael J. Swain.
Arc consistency: parallelism and domain dependence.
Artificial Intelligence, 58:207--235, 1992.
-
[BruynoogheVenken92]
-
Maurice Bruynooghe and Raf Venken.
Backtracking.
In Stuart C. Shapiro, editor, Encyclopedia of Artificial
Intelligence, volume 1. Addison-Wesley Publishing Company, 1992.
Second Edition.
-
[BrewkaEtal92]
-
Gerhard Brewka, Hans Werner Guesgen, and Joachim Hertzberg.
Constraint relaxation and nonmonotonic reasoning.
Technical Report TR-92-002, ICSI, University of Berkeley, 1992.
[ .ps.Z ]
-
[Bessiere92a]
-
Christian Bessière.
Using CSPs to encode TMSs.
Technical report, LIRMM, 1992.
-
[Bessiere92]
-
Christian Bessière.
Arc-consistency for non-binary dynamic constraint satisfaction
problems.
In B. Neumann, editor, Proceedings of the 10th European
Conference on Artificial Intelligence. John Wiley & Sons, Ltd, 1992.
-
[BennaceurPlateau92]
-
Hachemi Bennaceur and Gérard Plateau.
FAST: une méthode de résolution du problème lineaire de
satisfaction de contraintes.
Techniques et Sciences Informatiques, 11(3):33--57, 1992.
-
[ImbertHentenryck91]
-
Jean-Louis Imbert and Pascal Van Hentenryck.
A propos des redondances dans les systèmes d'inéquations
linéaires, Octobre 1991.
Actes JTASPEFL'91 Bordeaux.
-
[CollinEtal91a]
-
Zeev Collin, Rina Dechter, and Shmuel Katz.
On the Feasibility of Distributed Constraint Satisfaction.
In Proceedings of the Twelfth International Joint Conference on
Artificial Intelligence, IJCAI-91, Sidney, Australia, pages 318--324, August
1991.
-
[Bockmayr91]
-
A. Bockmayr.
Logic programming with pseudo-boolean constraints.
Technical Report MPI-I-91-227, Max Planck Institut für
Informatik, Saarbruecken, April/December 1991.
-
[SycaraEtal91]
-
Katia P. Sycara, Steven F. Roth, Norman Sadeh, and Mark S. Fox.
Resource Allocation in Distributed Factory Scheduling.
IEEE Expert, 6(1):29--40, February 1991.
-
[MengSullivan91]
-
Alex Chao-Chiang Meng and Michael Sullivan.
Logos: A Constraint-Directed Reasoning Shell for Operations
Management.
IEEE Expert, 6(1):20--28, February 1991.
-
[WangTsang91]
-
C.J. Wang and Edward P.K. Tsang.
Solving constraint--satisfaction problems using neural networks.
In IEEE Second International Conference on Artificial Neural
Networks, pages 295--299, 1991.
-
[VanHentenryckLeProvost91]
-
Pascal Van Hentenryck and Thiery Le Provost.
Incremental search in constraint logic programming.
New Generation Computing, 9:257--275, 1991.
-
[SosicGu91]
-
R. Sosic and J. Gu.
3,000,000 queens in less than one minute.
SIGART Bulletin, 2(2):22--24, 1991.
-
[Meiri91]
-
I. Meiri.
Combining qualitative and quantitative constraints in temporal
reasoning.
In Proceedings of the Ninth National Conference on Artificial
Intelligence, Anaheim, CA, USA, pages 260--267, 1991.
-
[MaruyamaEtal91]
-
F. Maruyama, Y. Minoda, S. Sawada, Y. Takizawa, and N. Kawato.
Solving combinatorial constraint satisfaction and optimization
problems using sufficient conditions for constraint violation.
In F. J. Cantu-Ortiz and H. Terashima-Marin, editors, Proc. of
the International Symposium on Artificial Intelligence, pages 269--275.
LIMUSA, Balderas, Mexico, 1991.
-
[JohnsonEtal91]
-
D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon.
Optimization by simulated annealing: an experimental evaluation; part
II, graph coloring and number partitioning.
Operations Research, 39(3):378--406, 1991.
-
[HillierLiebermann91]
-
Frederick S. Hillier and Gerald J. Liebermann.
Introducción a la Investigación de Operaciones.
McGraw-Hill, 1991.
-
[HentenryckDeville91]
-
Pascal van Hentenryck and Yves Deville.
The Cardinality Operator: A new Logical Connective for Constraint
Logic Programming.
Proceedings of the Eighth International Conference on Logic
Programming, ICLP'91, 2:745--759, 1991.
-
[Guesguen91]
-
H.W. Guesguen.
Connectionist Networks for Constraint Satisfaction.
In AAAI Spring Symposium on Constraint-based Reasoning, pages
182--190, Mar 1991.
-
[DevilleHentenryck91]
-
Yves Deville and Pascal Van Hentenryck.
An efficient arc consistency algorithm for a class of csp problems.
In Proceedings of the Twelfth International Joint Conference on
Artificial Intelligence, IJCAI-91, Sidney, Australia, pages 325--330, 1991.
-
[DechterEtal91]
-
Rina Dechter, Itay Meiri, and Judea Pearl.
Temporal constraint networks.
Artificial Intelligence, 49:61--95, 1991.
-
[CollinEtal91]
-
Zeev Collin, Rina Dechter, and Shmuel Katz.
Self-Stabilizing Distributed Constraint Satisfaction.
Under review. Preliminary version appeared as "On the Feasibility of
Distributed Constraint Satisfaction," in Proceedings of the Twelfth
International Joint Conference of Artificial Intelligence (IJCAI-91), pp.
318-324, Sidney, Australia, August, 1991, 1991.
-
[CheesemanEtal91]
-
Peter Cheeseman, Bob Kanefsky, and William M. Taylor.
Where the Really Hard Problems Are.
In Proceedings of the Twelfth International Joint Conference on
Artificial Intelligence, IJCAI-91, Sidney, Australia, pages 331--337, 1991.
-
[Bruynooghe91]
-
Maurice Bruynooghe.
Intelligent Backtracking Revisited.
In Jean-Louis Lassez and Gordon Plotkin, editors, Computational
Logic, Essays in Honor of Alan Robinson. The MIT press, 1991.
-
[Bessiere91]
-
Christian Bessière.
Arc-consistency in dynamic constraint satisfaction problems.
In Proceeding of the Ninth National Conference on Artificial
Intelligence, pages 221--226, 1991.
-
[MyersEtal90]
-
Brad A. Myers, Dario A. Giuse, Roger B. Dannenberg, Brad Vander Zanden,
David S. Kosbie, Edward Pervin, Andrew Mickish, and Philippe Marchal.
Garnet: Comprehensive Support for Graphical, Highly Interactive User
Interfaces.
IEEE Computer, 23(11):71--85, November 1990.
-
[HuynhEtal90]
-
Tien Huynh, Catherine Lassez, and Jean-Louis Lassez.
Fourier Algorithm Revisited.
In Hélène Kirchner and W. Wechler, editors, Proceedings
Second International Conference on Algebraic and Logic Programming, volume
463 of Lecture Notes in Computer Science, pages 117--131, Nancy,
France, October 1990. Springer-Verlag.
-
[Beaumont90]
-
Nicholas Beaumont.
An algorithm for disjunctive programs.
European Journal of Operations Research, 48(3):362--371,
October 1990.
-
[Nadel90]
-
Bernard A. Nadel.
Representation Selection for Constraint Satisfaction: A Case Study
Using n-Queens.
IEEE Expert, 5(3):16--23, June 1990.
-
[MittalFalkenhainer90]
-
Sanjay Mittal and Brian Falkenhainer.
Dynamic constraint satisfaction problems.
In Proceedings of the Eighth National Conference on Artificial
Intelligence, pages 25--32, 1990.
-
[MintonEtal90]
-
Steven Minton, Mark D. Jonston, Andrew B. Philips, and Philip Laird.
Solving large-scale constraint satisfaction and scheduling problems
using a heuristic repair method.
In Proceedings of the Eighth National Conference on Artificial
Intelligence, pages 17--24, 1990.
-
[KaldewaijSchoenmakers90]
-
Anne Kaldewaij and Berry Schoenmakers.
Searching by Elimination.
Science of Computer Programming, 14:243--254, 1990.
-
[HansenJaumard90]
-
Pierre Hansen and Brigitte Jaumard.
Algorithms for the Maximum Satisfiability Problem.
Computing, 44:277--303, 1990.
-
[Glover90]
-
F. Glover.
Tabu search - part II.
ORSA Journal on Computing, 2(1), 1990.
-
[Galton90]
-
Antony Galton.
A Critical Examination of Allen's Theory of Action and Time.
Artificial Intelligence, 42:159--188, 1990.
-
[Freeman-BensonEtal90]
-
Bjorn N. Freeman-Benson, John Maloney, and Alan Borning.
An Incremental Constraint Solver.
Communications of the ACM, 33:54--63, 1990.
-
[FeldmanGolumbic90a]
-
R. Feldman and M. C. Golumbic.
Optimization Algorithms for Student Scheduling via Constraint
Satisfiability.
Computer Journal, 33(4):356--364, 1990.
-
[FeldmanGolumbic90]
-
Ronen Feldman and Martin Charles Golumbic.
Interactive Scheduling as A Constraint Satisfiability Problem.
Annals of Mathematics and Artificial Intelligence, 1:49--73,
1990.
-
[DincbasEtal90]
-
Mehmet Dincbas, Helmut Simonis, and Pascal van Hentenryck.
Solving Large Combinatorial Problems in Logic Programming.
Journal of Logic Programming, 8:75--93, January-March 1990.
Special Issue: Logic Programming Applications.
-
[Diller90]
-
A. Diller.
Z: An Introduction to Formal Methods.
Chichester: Wiley, 1990.
-
[Dechter90]
-
R. Dechter.
Enhancement schemes for constraint processing: Backjumping, learning
and cutset decomposition.
Artificial Intelligence, 41:273--312, 1990.
-
[AdorfJohnston90]
-
H.M. Adorf and M.D. Johnston.
A discrete stochastic neural network algorithm for constraint
satisfaction problems.
In Proceedings of the International Joint Conference on Neural
Networks, 1990.
-
[LintonEtal89]
-
Mark A. Linton, John M. Vlissides, and Paul R. Calder.
Composing User Interfaces with InterViews.
IEEE Computer, 22(2):8--22, February 1989.
-
[ZwebenEskey89]
-
Monte Zweben and Megan Eskey.
Constraint satisfaction with delayed evaluation.
In Proceedings of the International Joint Conference on
Artificial Intelligence, pages 875--880, 1989.
-
[RivinZabih89]
-
Igor Rivin and Ramin Zabih.
An Algebraic Approach to Constraint Satisfaction Problems.
In Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, IJCAI-89, Detroit, Michigan, USA, pages 284--289,
1989.
-
[OttenGinneken89]
-
R. H. J. M. Otten and L. P. P. P. van Ginneken.
The annealing algorithm.
Kluwer Academic Publishers, 1989.
-
[Nadel89]
-
B. A. Nadel.
Constraint satisfaction algorithms.
Computational Intelligence, 5:188--224, 1989.
-
[Meseguer89]
-
Pedro Meseguer.
Constraint satisfaction problems: An overview.
AI Communications, 2(1):3--17, 1989.
-
[LadkinMaddux89]
-
P.B. Ladkin and R.D. Maddux.
On binary constraint networks.
Technical report, Kestrel Institute, Palo Alto, CA, USA, 1989.
-
[Hentenryck89]
-
Pascal van Hentenryck.
Constraint Satisfaction in Logic Programming.
The MIT press, 1989.
-
[Glover89]
-
F. Glover.
Tabu search - part I.
ORSA Journal on Computing, 1(3), 1989.
-
[FreuderWallace89]
-
Eugene C. Freuder and Richard J. Wallace.
Partial constraint satisfaction.
In Proceedings of the 11th International Joint Conference on
Artificial Intelligence (IJCAI-89), volume 58, pages 278--283, Detroit,
Michigan, USA, 1989.
[ .ps.gz ]
-
[Freuder89]
-
Eugene C. Freuder.
Partial Constraint Satisfaction.
In Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, IJCAI-89, Detroit, Michigan, USA, pages 278--283,
1989.
-
[FoxEtal89]
-
Mark S. Fox, Norman Sadeh, and Can Baykan.
Constrained Heuristic Search.
In Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, IJCAI-89, Detroit, Michigan, USA, pages 309--315,
1989.
-
[DechterMeiri89]
-
Rina Dechter and Itay Meiri.
Experimental Evaluation of Preprocessing Techniques in Constraint
Satisfaction Problems.
In Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, IJCAI-89, Detroit, Michigan, USA, pages 271--277,
1989.
-
[Cooper89]
-
Martin C. Cooper.
An Optimal k-Consistency Algorithm.
Artificial Intelligence, 41:89--95, 1989.
-
[DincbasEtal88]
-
M. Dincbas, H. Simonis, and P. Van Hentenryck.
Solving the Car-Sequencing Problem in Constraint Logic Programming.
In Proceedings of the 8th European Conference on Artificial
Intelligence, ECAI'88, Munich, Germany, pages 290--295, August 1988.
-
[Turner88]
-
J. S. Turner.
Almost all k-colorable graphs are easy to color.
Journal of Algorithms, 9:63--82, 1988.
-
[Nadel88a]
-
B. Nadel.
Tree search and arc consistency in constraint-satisfaction problems.
In L. Kanal and V. Kumar, editors, Search in Artificial
Intelligence, pages 287--342. Springer-Verlag, New York, 1988.
-
[Nadel88]
-
B. Nadel.
Tree Search and Arc Consistency in Constraint-Satisfaction
Algorithms.
In L. Kanal and V. Kumar, editors, Search in Artificial
Intelligence, pages 287--342. Springer-Verlag, 1988.
-
[Leler88]
-
Wm Leler.
Constraint Programming Languages, Their Specification and
Generation.
Addison-Wesley Publishing Company, 1988.
-
[JohnsonEtal88]
-
D.S. Johnson, C.H. Papadimitrou, and M. Yannakakis.
How easy is local search?
Journal of Computer and System Sciences, 37:79--100, 1988.
-
[HanLee88]
-
Ching-Chih Han and Chia-Hoang Lee.
Comments on Mohr and Henderson's Path Consistency Algorithm.
Artificial Intelligence, 36:125--130, 1988.
-
[DechterPearl88]
-
Rina Dechter and Judea Pearl.
Network-Based Heuristics for Constraint-Satisfaction Problems.
Artificial Intelligence, 34:1--38, 1988.
-
[DechterDechter88]
-
Rina Dechter and Avi Dechter.
Belief maintenance in dynamic constraint networks.
In Proceedings of the Seventh Annual Conference of the American
Association of Artificial Intelligence, pages 37--42, 1988.
-
[Bibel88]
-
W. Bibel.
Constraint Satisfaction from a Deductive Viewpoint.
Artificial Intelligence, 35:401--413, 1988.
-
[JaffarLassez87]
-
Joxan Jaffar and Jean-Louis Lassez.
Constraint logic-programming.
In Proceedings of the 14th Annual ACM Symposium on Principles of
Programming Languages, pages 111--119, München, 1987.
-
[FendlerWichlacz87]
-
Mario Fendler and Rainer Wichlacz.
Symbolische constraint-propagierung auf netzwerken - entwurf und
implementierung.
Memo 15, SFB 314, Universit"at des Saarlandes, Saarbrücken, 1987.
-
[DavisSteenstrup87]
-
Lawrence Davis and Martha Steenstrup.
Genetic Algorithms and Simulated Annealing: An Overview,
chapter 1, pages 1--11.
In Davis [Davis87], 1987.
-
[Davis87a]
-
Ernest Davis.
Constraint Propagation with Interval Labels.
Artificial Intelligence, 32:281--331, 1987.
-
[Davis87]
-
Lawrence Davis, editor.
Genetic Algorithms and Simulated Annealing.
Research Notes in Artificial Intelligence. Morgan Kaufmann, Inc., Los
Altos, CA, 1987.
-
[VilainKautz86]
-
M. Vilain and H. Kautz.
Constraint propagation algorithms for temporal reasoning.
In Proceedings of the Fourth National Conference on Artificial
Intelligence, Philadelphia, PA, pages 377--382, 1986.
-
[ParrelloKabat86]
-
B. Parrello and W. C. Kabat.
Job-shop scheduling using automated reasoning: A case study of the
car-sequencing problem.
Journal of Automated Reasoning, 2:1--42, 1986.
-
[MontanariRossi86]
-
Ugo Montanari and Francesca Rossi.
An Efficient Algorithm for the Solution of Hierarchical Networks of
Constraints.
In H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld, editors,
Proceedings of Third International Workshop on Graph-Grammars and Their
Application to Computer Science, volume 291 of Lecture Notes in
Computer Science, pages 440--457. Springer-Verlag, 1986.
-
[MohrMasini86]
-
Roger Mohr and Gérald Masini.
Running Efficiently Arc Consistency.
Technical Report 86-R-001, Centre de Recherche en Informatique de
Nancy, CRIN, Vandoeuvre lès Nancy, France, 1986.
-
[MohrHenderson86]
-
Roger Mohr and Thomas C. Henderson.
Arc and Path Consistency Revisited.
Artificial Intelligence, 28:225--233, 1986.
-
[Freuder85]
-
Eugene C. Freuder.
A Sufficient Condition for Backtrack-Bounded Search.
Journal of the ACM, 32(4):755--761, October 1985.
-
[MackworthFreuder85a]
-
Alan K. Mackworth and Eugene C. Freuder.
The Complexity of Some Polynomial Network Consistency Algorithms for
Constraint Satisfaction Problems.
Artificial Intelligence, 25:65--74, 1985.
-
[MackworthFreuder85]
-
Alan K. Mackworth and Eugene C. Freuder.
The complexity of some polynominal network consistency algorithms for
constraint satisfaction problems.
Artificial Intelligence, 25:65--74, 1985.
-
[DechterPearl85]
-
R. Dechter and J. Pearl.
A Problem Simplification Approach that Generates Heuristics for
Constraint-Satisfaction Problems.
Machine Intelligence, 11:125--155, 1985.
-
[DermanWyk84]
-
Emanuel Derman and Christopher J. Van Wyk.
A Simple Equation Solver and its Application on Financial
Modelling.
Software - Practice and Experience, 14(12):1169--1181, December
1984.
-
[AllenKoomen83]
-
James F. Allen and Johannes A. Koomen.
Planning Using a Temporal World Model.
In Proceedings of the Eighth International Joint Conference on
Artificial Intelligence, IJCAI-83, Karlsruhe, West Germany, pages 741--747,
August 1983.
-
[Simon83]
-
Herbert A. Simon.
Search and Reasoning in Problem Solving.
Artificial Intelligence, 21:7--29, 1983.
-
[Purdom83]
-
Paul Walton Purdom, Jr.
Search Rearrangement Backtracking and Polynomial Average Time.
Artificial Intelligence, 21:117--133, 1983.
-
[Nudel83]
-
Bernard Nudel.
Consistent-Labeling Problems and their Algorithms:
Expected-Complexities and Theory-Based Heuristic.
Artificial Intelligence, 21:135--178, 1983.
-
[Lenat83]
-
Douglas B. Lenat.
Theory Formation by Heuristic Search.
Artificial Intelligence, 21:31--59, 1983.
-
[KumarKanal83]
-
Vipin Kumar and Laveen N. Kanal.
A General Branch and Bound Formulation for Understanding and
Synthesizing And/Or Tree Search Procedures.
Artificial Intelligence, 21:179--198, 1983.
-
[Allen83]
-
James F. Allen.
Maintaining Knowledge about Temporal Intervals.
Communications of the ACM, 26(11):832--843, 1983.
-
[BrownPurdom82]
-
Cynthia A. Brown and Paul W. Purdom, Jr.
An Empirical Comparation of Backtracking Algorithms.
IEEE Transactions on Pattern Analysis and Machine Intelligence,
PAMI-4(3):309--316, May 1982.
-
[Wyk82]
-
Christopher J. Van Wyk.
A High-Level Language for Specifying Pictures.
ACM Transactions on Graphics, 1(2):163--182, April 1982.
-
[GoldbergEtal82]
-
A. Goldberg, Jr. P. W. Purdom, and C. A. Brown.
Average time analysis of simplified Davis-Puttnam procedures.
Information Process, Lett., 15:72--75, 1982.
-
[Freuder82a]
-
E. C. Freuder.
A sufficient condition for backtrack-free search.
Journal of the Association for Computing Machinery,
29(1):24--32, January 1982.
-
[Freuder82]
-
Eugene C. Freuder.
A Sufficient Condition for Backtrack-Free Search.
Journal of the ACM, 29(1):24--32, January 1982.
-
[BrownPurdom81]
-
Cynthia A. Brown and Paul Walton Purdom, Jr.
An Average Time Analysis of Backtracking.
SIAM Journal of Computing, 10(3):583--593, August 1981.
-
[PurdomEtal81]
-
Paul Walton Purdom, Jr., Cynthia A. Brown, and Edward L. Robertson.
Backtracking with Multi-Level Dynamic Search Rearrangement.
Acta Informatica, 15:99--113, 1981.
-
[CoxPietrzykowski81]
-
Philip T. Cox and Tomasz Pietrzykowski.
Deduction Plans: A Basis for Intelligent Backtracking.
IEEE Transactions on Pattern Analysis and Machine Intelligence,
3(1):52--65, January 1981.
-
[Bruynooghe81]
-
Maurice Bruynooghe.
Solving Combinatorial Search Problems by Intelligent Backtracking.
Information Processing Letters, 12(1):36--39, 1981.
-
[SussmanSteele80]
-
Gerald Jay Sussman and Guy Lewis Steele Jr.
CONSTRAINTS - A Language for Expressing Almost-Hierarchical
Descriptions.
Artificial Intelligence, 14:1--39, 1980.
-
[HaralickElliott80]
-
R. M. Haralick and G. L. Elliott.
Increasing tree search efficiency for constraint satisfaction
problems.
Artificial Intelligence, 1980.
14:263-313.
-
[HaralickElliot80a]
-
Robert M. Haralick and Gordon L. Elliot.
Increasing Tree Search Efficiency for Constraint Satisfaction
Problems.
Artificial Intelligence, 14:263--313, 1980.
-
[HaralickElliot80]
-
R. M. Haralick and G. L. Elliot.
Increasing tree search efficiency for constraint satisfaction
problems.
Artificial Intelligence Journal, 14:263--314, 1980.
-
[Cohen79]
-
Jacques Cohen.
Non-Deterministic Algorithms.
Computing Surveys, 11(2):79--94, June 1979.
-
[HaralickShapiro79]
-
Robert M. Haralick and Linda G. Shapiro.
The Consistency Labeling Problem: Part I.
IEEE Transactions on Pattern Analysis and Machine Intelligence,
PAMI-1(2):173--184, april 1979.
-
[GareyJohnson79]
-
M. R. Garey and D. S. Johnson.
Computers and Intractability: A Guide to the Theory of
NP-Completeness.
W.H. Freeman and Company, New York, 1979.
-
[Brelaz79]
-
D. Brélaz.
New methods to color the vertices of a graph.
Communications of the ACM, 22(4):251--256, 1979.
-
[Purdom78]
-
Paul W. Purdom.
Tree Size by Partial Backtracking.
SIAM Journal of Computing, 7(4):481--491, November 1978.
-
[Freuder78]
-
Eugene C. Freuder.
Synthesizing Constraint Expressions.
Communications of the ACM, 21(11):958--966, November 1978.
-
[Williams78]
-
H.P. Williams.
Model Building in Mathematical Programming.
J. Wiley and Sons, New York, 1978.
-
[Lauriere78]
-
Jean-Louis Lauriere.
A Language and a Program for Stating and Solving Combinatorial
Problems.
Artificial Intelligence, 10:29--127, 1978.
-
[Mackworth77]
-
Alan K. Mackworth.
Consistency in networks of relations.
Artificial Intelligence, 8:99--118, 1977.
-
[Waltz75]
-
David Waltz.
Understanding lines drawings of scenes with shadows.
In Patrick H. Winston, editor, The Psychology of Computer
Vision, Computer Science Series, pages 19--91. McGraw-Hill, 1975.
-
[BitnerReingold75]
-
James J. Bitner and Edward M. Reingold.
Backtrack Programming Techniques.
Communications of the ACM, 18(11):651--656, 1975.
-
[BobrowRaphael74]
-
Daniel G. Bobrow and Bertram Raphael.
New Programming Languages for Artificial Intelligence Research.
Computing Surveys, 6(3):153--174, September 1974.
-
[Montanari74]
-
Ugo Montanari.
Networks of constraints: Fundamental properties and applications to
picture processing.
Information Sciences, 7:95--132, 1974.
-
[LinKernighan73]
-
S. Lin and B. W. Kernighan.
An effective heuristic algorithm for the travelling salesman problem.
Operations Research, 21:498--516, 1973.
-
[Nilsson71]
-
Nils J. Nilsson.
Problem-Solving Methods in Artificial Intelligence.
Computer Science SERIES. McGraw-Hill, 1971.
-
[Roth70]
-
Richard H. Roth.
An Approach to Solving Linear Discrete Optimization Problems.
Journal of the ACM, 17(2):303--313, April 1970.
-
[Caviness70]
-
B. F. Caviness.
On Canonical Forms and Simplification.
Journal of the ACM, 17(2):385--396, April 1970.
-
[Fikes70]
-
Richard E. Fikes.
REF-ARF: A System for Solving Problems Stated as Procedures.
Artificial Intelligence, 1:27--120, 1970.
-
[Floyd67]
-
Robert W. Floyd.
Nondeterministic Algorithms.
Journal of the ACM, 14(4):636--644, October 1967.
-
[GolombBaumert65]
-
Solomon W. Golomb and Leonard D. Baumert.
Backtrack Programming.
Journal of the ACM, 12(4):516--524, October 1965.
-
[Walker60]
-
R. L. Walker.
An Enumerative Technique for a Class of Combinatorial Problems.
In Combinatorial Analysis, Proceedings of Symposium in Applied
Mathematics, Vol X, Amer. Math. Soc., Providence, RI, USA, pages 91--94,
1960.
-
[WyattMcAloon]
-
Katherine Wyatt and Ken McAloon.
Decomposition of Disjunctive Linear Programs for Fixed-Income
Portfolio Selection.
-
[Sacks]
-
Elisha Sacks.
Hierarchical Reasoning about Inequalities.
-
[OussalahPuig]
-
C. Oussalah and V. Puig.
Combining Constraints and Objects.
-
[Miguela]
-
Alfonso San Miguel.
Symmetries and the Cardinality Operator.
-
[Miguel]
-
Alfonso San Miguel.
How to Use Symmetries in Boolean Constraint Solving.
-
[MenezesBarahona]
-
Francisco Menezes and Pedro Barahona.
A Framework for User-Refined Constraint Solvers over Finite
Domains.
-
[McAloonEtal]
-
Ken McAloon, Carol Tretkoff, and Gerhard Wetzel.
Disjunctive Programming and Cooperating Solvers.
-
[MajorEtal]
-
Francois Major, Guy Lapalme, and Robert Cedergren.
Domain generating functions for solving constraint satisfaction
problems.
-
[Leconte]
-
Michel Leconte.
Propagation et Recherche sous Contraintes.
-
[Hentenryck]
-
Pascal Van Hentenryck.
Incremental Constraint Satisfaction in Logic Programming.
-
[Greenberg]
-
Harvey J. Greenberg.
Consistency, Redundancy, and Implied Equalities in Linear Systems.
-
[FreuderQuinn]
-
Eugene C. Freuder and Michael J. Quinn.
Taking Advantage of Stable Sets of Variables in Constraint
Satisfaction Problems.
In Proceedings, pages 1076--1078.
-
[DechterPearl]
-
Rina Dechter and Judea Pearl.
The Anatomy of Easy Problems: A Constraint-Satisfaction
Formulation.
In Proceedings, pages 1066--1072.
-
[DavenportTsang]
-
Andrew Davenport and Edward Tsang.
Solving constraint satisfaction sequencing problems by iterative
repair.
-
[CreemersEtal]
-
Tom Creemers, Lluís Ros Giralt, and Jordi Riera.
A Constraint-Propagation Approach to Distribution-Systems
Maintenance Scheduling.
IEEE Expert.
-
[BerlinerGoetsch]
-
Hans Berliner and Gordon Goetsch.
A Study of Search Methods: The Effect of Constraint Satisfaction and
Adventurousness.
In Proceedings, pages 1079--1082.
Total: 427
|
Copyright © by the contributing authors. All material on this collaboration platform is the property of the contributing authors.