Explicit design space?

This paper examines the need for explicit representations of the design space, in response to Woodbury and Burrow. Specifically, their proposal for a particular search strategy, by means of which one can reuse past experiences explicitly represented by previously traversed paths, is examined. This is done by exploring issues with respect to design search and representation in general, while relating these to specific issues raised by Woodbury and Burrow. The paper concludes by suggesting that their arguments essentially point to devising an appropriate “programming language” for design.

[1]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[2]  Ramesh Krishnamurti.  The Maximal Representation of a Shape , 1992 .

[3]  G. Stiny.  Shape Rules: Closure, Continuity, and Emergence , 1994 .

[4]  J. Kagan,et al.  Rational choice in an uncertain world , 1988 .

[5]  Chris F. Earl.  Generated designs: Structure and composition , 1999, Artif. Intell. Eng. Des. Anal. Manuf..

[6]  George Stiny.  Emergence and continuity in shape grammars , 1993 .

[7]  Luca Cardelli,et al.  A Semantics of Multiple Inheritance , 1984, Inf. Comput..

[8]  Rudi Stouffs,et al.  Representational Flexibility for Design , 2002, AID.

[9]  Teng-Wen Chang,et al.  Typed feature structures and design space exploration , 1999, Artif. Intell. Eng. Des. Anal. Manuf..

[10]  A. Paoluzzi,et al.  Boolean algebra over linear polyhedra , 1989 .

[11]  C. Carlson.  Grammatical programming: an algebraic approach to the description of design spaces , 1993 .

[12]  A. Rubinstein.  Modeling Bounded Rationality , 1998 .

[13]  Rudi Stouffs,et al.  The Extensibility and Applicability of Geometric Representations , 1996 .

[14]  Ö. Akin.  "Simon Says": Design is Representation , 2003 .

[15]  H. Aït-Kaci.  A lattice theoretic approach to computation based on a calculus of partially ordered type structures (property inheritance, semantic nets, graph unification) , 1984 .

[16]  Rudi Stouffs,et al.  The boundary of a shape and its classification , 2004 .

[17]  Rudi Stouffs,et al.  On a query language for weighted geometries , 1996 .

[18]  Herbert A. Simon,et al.  The Structure of Ill Structured Problems , 1973, Artif. Intell..

[19]  Ramesh Krishnamurti,et al.  Spatial Change: Continuity, Reversibility, and Emergent Shapes , 1997 .

[20]  Bruce G. Baumgart.  A polyhedron representation for computer vision , 1975, AFIPS '75.

[21]  Ömer Akin.  A Formalism for Problem Restructuring and Resolution in Design , 1986 .

[22]  Martti Mäntylä,et al.  Introduction to Solid Modeling , 1988 .

[23]  Rudi Stouffs,et al.  A Formal Structure for Nonequivalent Solid Representations , 1996 .

[24]  Dana S. Scott,et al.  Data Types as Lattices , 1976, SIAM J. Comput..

[25]  Bob Carpenter,et al.  The logic of typed feature structures , 1992 .

[26]  Kazimierz Kuratowski,et al.  Introduction to Set Theory and Topology , 1964 .

[27]  Michael Batty,et al.  Environment and Planning B: Planning and Design , 1996 .

[28]  Ömer Akin,et al.  Variants in Design Cognition , 2001 .

[29]  Joe Stoy,et al.  Denotational Semantics , 1977 .