%T Branch and Sample: a simple strategy for constraint satisfaction
%A Galle, P.
%D 1989
%K constraint satisfaction, Branch and Sample, optimization, search tree Dec89
%J BIT
%V 29
%N 3
%P 395-408

%T The complexity of some polynomial network consistency algorithms for
constraint satisfaction problems
%A Mackworth, A.K.
%A Freuder, E.C.
%D Jan. 1985
%K artificial intelligence, polynomial network consistency algorithms, 1985 constraint satisfaction problems, artificial intelligence, time complexity, arc consistency, Waltz filtering algorithm, edge labelling, computational vision, constraint graph
%O Artif. Intell. (Netherlands)
%J Artificial Intelligence
%V 25
%N 1
%P 65-73

%T Constraint Satisfaction
%A Mackworth, A.K.
%D Sept 1985
%I Department of Computer Science, University of British Columbia
%C Vancouver
%R TR 85-15
%K BColumbia

%T Hierarchial arc consistency: exploiting structured domains in constraint satisfaction problems
%A Mackworth, A.K.
%A Mulder, A.J.
%A Havens, W.S.
%D 19 Jul 85
%I Department of Computer Science, University of British Columbia
%C Vancouver
%R TR 85-7A Vol. 1 No. 3
%K BColumbia

%T Introduction to artificial intelligence
%A Charniak, E.
%A McDermott, D.
%D 1985
%I Addison-Wesley Publishing Company
%P 649-650

%T Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
%A Dechter, R.
%D Jan. 1990
%K enhancement schemes, constraint processing, backjumping, learning, cutset Apr90 decomposition, constraint satisfaction problems, logic programming, truth maintenance systems, backtracking algorithm, constraint graph
%J Artificial Intelligence
%V 41
%N 3
%P 273-312

%T Synthesizing Constraint Expressions
%A Freuder, E.C.
%J Communications of the ACM
%V 21
%N 11
%P 958-965
%D November 1978

%T Network-based heuristics for constraint-satisfaction problems
%A Dechter, R.
%A Pearl, J.
%D Dec. 1987
%K artificial intelligence, network based heuristics, constraint-satisfaction 1988 problems, sparse networks, trees
%O Artif. Intell. (Netherlands)
%J Artificial Intelligence
%V 34
%N 1
%V A01
%P 1-38

%T A sufficient condition for backtrack-bounded search
%A Freuder, E.C.
%D Oct. 1985
%K exponential bounds, computational complexity, sufficient condition, 1986 backtrack-bounded search, constraint satisfaction problems, largest biconnected component, constraint graph
%O J. Assoc. Comput. Mach. (USA)
%J Journal of the Association for Computing Machinery
%V 32
%N 4
%V A01
%P 755-61

%T Intelligent Systems Techniques - Lecture notes
%A Bridge, D.G
%D Jan. 1991
%O University of York (UK)

%T Integrated Network Management Systems - A Global Perspective on the Issue
%A Feldkhun, L.
%D May 14-17, 1989
%J Integrated Network Management: Proc. of the IFIP TC 6/WG 6.6 Symp.  on Integrated Network Management
%P 279-304
%C Boston, Massachusetts
%I North-Holland

%T Standardization Issues in Integrated Network Management
%A Kobayashi, Y.
%D May 14-17, 1989
%J Integrated Network Management: Proc. of the IFIP TC 6/WG 6.6 Symp.  on Integrated Network Management
%P 79-92
%C Boston, Massachusetts
%I North-Holland