BaykanC., 1991Formulating Spatial Layout as a Disjunctive Constraint Satisfaction Problem PhD thesis, School of Architecture, Carnegie-Mellon University, Pittsburgh, PA
2.
CormenT.H., LeisersonC.E., RivestR.L., 1989Introduction to Algorithms (MIT Press, Cambridge, MA)
3.
DavisE., 1987, “Constraint propagation with interval labels”Artificial Intelligence32281–331
4.
FlemmingU., 1978, “Wall representations of rectangular dissections and their use in automated space allocation”Environment and Planning B5215–232
5.
FlemmingU., 1979, “Representing an infinite set of solutions through a finite set of principal options”, in Proceedings of the 10th Conference of the Environmental Design Research Association Eds SeidelA, DanfordS; Environmental Design Research Association, Milwaukee, WI, pp 190–197
6.
FlemmingU., 1980, “Wall representations of rectangular dissections: additional results”Environment and Planning B7247–251
7.
FlemmingU., 1986, “On the representation and generation of loosely packed arrangements of rectangles”Environment and Planning B: Planning and Design13189–205
8.
FlemmingU., 1989, “More on the representation and generation of loosely packed arrangements of rectangles”Environment and Planning B: Planning and Design16327–359
9.
FlemmingU., WoodburyR., 1995, “Software environment to support early phases in building design (SEED): Overview”Journal of Architectural Engineering1147–152
10.
FlemmingU., BaykanC.A., CoyneR.F., FoxM.S., 1992, “Hierarchical generate-and-test vs. constraint-directed search. A comparison in the context of layout synthesis”, in Artificial Intelligence in Design ′92 Ed. GeroJ (Kluwer, Dordrecht) pp 817–838
11.
SEED team, 1997, “SEED—Software environment to support early phases in building design”http://seed.edrc.cmu.edu/IJDC
