See this document in CiteSeerX!

Representation and Reasoning with Non-Binary Constraints (2001)  (Make Corrections)  
Kostas Stergiou



  Home/Search   Context   Related

 
View or download:
dcs.stand.ac.uk/~a...StergiouPhD.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  dcs.stand.ac.uk/~apes/2001 (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Many problems from the \real world" can be eciently expressed as constraint satisfaction problems (CSPs). Most of these can be naturally modelled using n-ary (or non-binary) constraints. Representing problems with n-ary constraints and reasoning with them is therefore very important in constraint satisfaction. However, issues regarding n-ary constraints have been neglected compared to binary constraints. The reasons were the simplicity of dealing with binary constraints compared to nary and the ... (Update)

Active bibliography (related documents):   More   All
1.3:   Dynamic Flexible Constraint Satisfaction and its Application to.. - Miguel (2001)   (Correct)
1.0:   Backtracking Algorithms for Disjunctions of Temporal.. - Stergiou, Koubarakis (1998)   (Correct)
0.9:   Domain Filtering Consistencies - Debruyne (2001)   (Correct)

Similar documents based on text:   More   All
1.0:   Artificial Intelligence 123 (2000) 133--156 - Decomposable Constraints Ian   (Correct)
0.9:   Decomposable Constraints - Ian Gent Kostas (1999)   (Correct)
0.6:   Encodings of Non-Binary Constraint Satisfaction Problems - Kostas Stergiou And (1999)   (Correct)

BibTeX entry:   (Update)

@misc{ stergiou-representation,
  author = "Kostas Stergiou",
  title = "Representation and Reasoning with Non-Binary Constraints",
  url = "citeseer.ist.psu.edu/stergiou01representation.html" }
Citations (may not include all citations):
702   Consistency in Networks of Relations (context) - Mackworth - 1977
473   Foundations of Constraint Satisfaction (context) - Tsang - 1993
340   Temporal Constraint Networks (context) - Dechter, Meiri et al. - 1991
329   Where the really hard problems are - Cheeseman, Kanefsky et al. - 1991
307   Networks of Constraints: Fundamental Properties and Applicat.. (context) - Montanari - 1974
271   The oz programming model - Smolka - 1995
267   Network-Based Heuristics for Constraint Satisfaction Problem.. (context) - Dechter, Pearl - 1988
214   Constraint Satisfaction in Logic Programming (context) - Van Hentenryck - 1989
211   Enhancement Schemes for Constraint Processing: Backjumping (context) - Dechter - 1990
191   Algorithms for Constraint Satisfaction Problems: a Survey - Kumar - 1992
190   Using csp look-back techniques to solve real-world sat insta.. - Jr, Schrag - 1997
188   Collective Dynamics of Small-World Networks (context) - Watts, Strogatz - 1998
185   The Complexity of some Polynomial Network Consistency Algori.. (context) - Mackworth, Freuder - 1985
166   Synthesizing Constraint Expressions (context) - Freuder - 1978
141   Tree Clustering for Constraint Networks (context) - Dechter, Pearl - 1989
134   Limited discrepancy search - Harvey, Ginsberg - 1995
119   Contradicting conventional wisdom in constraint satisfaction - Sabin, Freuder - 1994
119   Simple Linear Time Algorithms to Test Chordality of Graphs (context) - Tarjan - 1984
112   Performance measurement and analysis of certain search algor.. (context) - Gaschnig - 1979
112   New Methods to color the vertices of a graph (context) - Brelaz - 1979
97   Consistency techniques for numeric csps (context) - Lhomme - 1993
87   A theoretical evaluation of selected backtracking algorithms - Kondrak, van Beek - 1995
87   A Theoretical Evaluation of Selected Backtracking Algorithms - Kondrak, van Beek - 1997
83   An Algorithm for Solving the Job Shop Problem (context) - Carlier, Pinson - 1989
65   Implementation of CLP (context) - Puget - 1994
63   the conversion between non-binary and binary constraint sati.. - Bacchus, van Beek - 1998
61   Introducing Global Constraints in CHIP - Beldiceanu, Contejean - 1994
60   A Davis-Putnam Program and its Application to Finite First-O.. - McCune - 1994
59   The constrainedness of search - Gent, MacIntyre et al. - 1996
59   Arc-consistency and arc-consistency again - Bessi, Cordier - 1993
59   Arc-Consistency and Arc-Consistency Again - Bessi - 1994
56   Good old discrete relaxation (context) - Mohr, Masini - 1988
54   A Generic Arc Consistency Algorithm and its Specializations - Van Hentenryck, Deville et al. - 1992
52   the equivalence of constraint satisfaction problems - Rossi, Petrie et al. - 1990
51   Dead-end driven learning - Frost, Dechter - 1994
50   Constraint handling rules - Fruhwirth - 1994
45   Search Rearrangement Backtracking and Polynomial Average Tim.. (context) - Purdom - 1983
44   Stochastic Local Search | Methods (context) - Hoos - 1998
43   SEM: a System for Enumerating Models (context) - Zhang, Zhang - 1995
42   Constraint Satisfaction Problems: An Overview (context) - Meseguer - 1989
40   Time and Resource-Constrained Scheduling: A Constraint Satis.. (context) - Nuijten - 1994
40   A theoretical and experimental comparison of constraint prop.. - Baptiste, Le Pape - 1995
39   Consistent-Labeling Problems and their Algorithms: Expected .. (context) - Nudel - 1983
39   Experimental Evaluation of Preprocessing Algorithms for Cons.. (context) - Dechter, Meiri - 1994
38   Symmetry breaking during search in constraint programming - Gent, Smith - 2000
38   Problem structure in the presence of perturbations - Gomes, Selman - 1997
36   Finite Domain Enumerator: Notes and Guide (context) - Slaney - 1992
35   Look-ahead value orderings for constraint satisfaction probl.. - Frost, Dechter - 1995
35   Dual viewpoint heuristics for binary constraint satisfaction.. (context) - Geelen - 1992
34   Depth-bounded discrepancy search - Walsh - 1997
33   Implementing the Davis-Putnam Algorithm by Tries - Zhang - 1994
28   Search in a small world - Walsh - 1999
27   Interval computation as deduction in CHIP - Lee, van Emden - 1993
27   Compiling Constraints in clp (context) - Codognet, Diaz - 1996
27   A general backtrack algorithm that eliminates most redundant.. (context) - Gaschnig - 1977
26   A computational study of constraint satisfaction for multipl.. - Nuijten, Aarts - 1996
25   Backtracking algorithms for disjunctions of temporal constra.. - Stergiou, Koubarakis - 1998
25   Search lessons learned from crossword puzzles - Ginsberg, Frank et al. - 1990
25   Backtracking Algorithms for Disjunctions of Temporal Constra.. - Stergiou, Koubarakis - 2000
23   A Sucient Condition for Backtrack-Free Search (context) - Freuder - 1982
23   The progressive party problem: Integer linear programming an.. - Smith, Brailsford et al. - 1996
19   Dynamic Programming Algorithms for Recognizing Small Bandwid.. (context) - Saxe - 1980
18   Lazy arc consistency - Schiex, egin et al. - 1996
18   Generalized arc consistency for global cardinality constrain.. (context) - egin - 1996
18   the forward checking algorithm - Bacchus, Grove - 1995
18   Claire: Combining objects and rules for problem solving - Caseau, Laburthe - 1996
18   Encodings of non-binary constraint satisfaction problems - Stergiou, Walsh - 1999
17   Modelling the golomb ruler problem - Smith, Stergiou et al. - 1999
16   Algorithm portfolio design: Theory vs (context) - Gomes, Selman - 1997
16   Neighborhood inverse consistency preprocessing - Freuder, Elfe - 1996
16   Arti- cial Intelligence (context) - Gent, Stergiou et al. - 2000
15   From restricted path consistency to maxrestricted path consi.. - Debruyne, Bessi - 1997
15   Constraint-based optimization and approximation for job shop.. - Baptiste, Le Pape et al. - 1995
15   Minimal forward checking - Dent, Mercer - 1994
14   Arc Consistency for Factorable Relations (context) - Perlin - 1992
13   the Minimality and Global Consistency of Row-Convex Constrai.. - van Beek, Dechter - 1995
13   Forward checking with backmarking - Prosser - 1995
13   Decomposable constraints - Gent, Stergiou et al. - 2000
13   A ltering algorithm for constraints of di erence in csps (context) - egin - 1994
12   Interleaved and discrepancy based search - Meseguer, Walsh - 1998
12   Using inference to reduce arc consistency computation - Bessi, Freuder et al. - 1995
12   Locating the Phase Transitions in Constraint Satisfaction Pr.. (context) - Smith, Dyer - 1996
12   Analysis of Heuristics for Number Partitioning (context) - Gent, Walsh - 1998
12   A Sucient Condition for Backtrack-Bounded Search (context) - Freuder - 1985
12   Arc consistency for general constraint networks: Preliminary.. - Bessi, egin - 1997
11   erence all-di erence makes (context) - Stergiou, Walsh - 1999
11   Using auxiliary variables and implied constraints to model n.. - Smith, Stergiou et al. - 2000
10   Arti cial Intelligence (context) - Mohr, Henderson et al. - 1986
10   Embedding Incomplete Latin Squares (context) - Evans - 1960
10   On forward checking for non-binary constraint satisfaction - Bessi, Meseguer et al. - 1999
10   Singleton consistencies - Prosser, Stergiou et al. - 2000
9   Path consistency revisited - Singh - 1995
9   A Theoretical Comparison of Selected CSP Solving and Modelin.. (context) - Chen - 2000
9   Arc consistency and quasigroup completion - Shaw, Stergiou et al. - 1998
9   Mac and combined heuristics: Two reasons to forsake fc (context) - Bessi, egin - 1996
8   A Comparative Study of Eight Constraint Programming Language.. (context) - Fernandez, Hill - 2000
8   Embedding Partial Steiner Triple Systems is NPComplete (context) - Colbourn - 1983
7   A ltering algorithm for global sequencing constraints (context) - egin, Puget - 1997
7   A Property of Path Inverse Consistency Leading to an Optimal.. - Debruyne - 1998
7   The logic of search algorithms: Theory and applications - Gent, Underwood - 1997
6   Extending forward checking - Bacchus - 2000
6   Heavy-tailed probability distributions in combinatorial sear.. - Gomes, Selman et al. - 1997
6   Automatic generation of some results in nite algebra (context) - Fujita, Slaney et al. - 1993
5   Formulation Selection for Constraint Satisfaction Problems: .. (context) - Borrett - 1998
5   Some practicable ltering techniques for the constraint satis.. (context) - Debruyne, Bessi - 1997
4   The Design and Experimental Analysis of Algorithms for Tempo.. - van Beek, Manchak - 1996
4   Encyclopedia of Arti cial Intelligence (context) - Dechter, Survey - 1992
4   An ecient arc consistency algorithm for a class of csp probl.. (context) - Deville, Van Hentenryck - 1991
3   A constraint programming approach to planning (context) - van Beek, Chen - 1999
3   Two new constraint propagation algorithms requiring small sp.. (context) - Chmeiss, egou - 1996
3   An Empirical Study of Phase Transitions in Binary Costraint .. (context) - Prosser - 1996
3   A New Construction on Latin Squares-1: A Proof of the Evans .. (context) - Smetaniuk - 1981
3   Thank evans (context) - Andersen, Hilton - 1983
2   Properties of some combinatorial optimization problems and t.. (context) - Darby-Dowman, Little - 1998
2   planningscheduling methodology constrained resource problem (context) - Keng, scheduling et al. - 1989
2   MAC-CBJ: maintaining arc-consistency with con ictdirected ba.. (context) - Prosser - 1995
2   Integer linear programming and constraint programming approa.. (context) - Proll, Smith - 1998
2   Hybrid Algorithms for the Costraint Satisfaction Problem (context) - Prosser - 1993
1   the satis ability of symmetrical constraint satisfaction pro.. (context) - Puget - 1993
1   A Note on CSPLIB prob (context) - Simonis, Beldiceanu - 1999
1   Some applications of graph banwidth to constraint satisfacti.. (context) - Zabih - 1990
1   Increasing Tree Eciency for Costraint Satisfaction Problems (context) - Haralick, Elliot - 1980
1   A generic customizable framework for inverse local consisten.. (context) - Varfallie, Martinez et al. - 1999
1   Enforcing arc consistency on global constraints by solving s.. - Bessi, egin - 1999
1   Represenation Selection for Constraint Satisfaction: A Case .. (context) - Nudel - 1990
1   The symmetric all-di erent constraint (context) - egin - 1999
1   The Satis ability Constraint Gap (context) - Gent, Walsh - 1996
1   A new approach to integrade mixed integer programming with C.. (context) - Rodosek, Wallace et al.
1   Improving domain ltering using restricted path consistency (context) - Berlandier - 1995

Documents on the same site (http://www.dcs.st-and.ac.uk/~apes/2001.html):   More
Dynamic Flexible Constraint Satisfaction and its Application to.. - Miguel (2001)   (Correct)
Frozen Development in Graph Coloring - Culberson, Gent (2000)   (Correct)
Dual Models of Permutation Problems - Smith (2001)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC