On the computability of affordances as relations. Issue 3 (28th July 2015)

• Record Type: Journal Article
• Authors: Brown, David C.; Maier, Jonathan R.A.; Maier, Jonathan R.A.
• Is Part Of: AI EDAM. Volume 29:Issue 3(2015)
• Page Start: 249
• Page End: 256
• Publication Date: 2015-07-28
• Subjects: Engineering design -- Data processing -- Periodicals; Artificial intelligence -- Periodicals; Expert systems (Computer science) -- Periodicals; 620.00420285
• DOI: 10.1017/S0890060415000207
• Languages: English
• ISSNs: 0890-0604

Abstract

<abstract abstract-type="normal"> <title>Abstract</title> <p>One of the principal advantages of affordance-based design is that Gibson's theory of affordances is a relational theory, akin to other relational approaches such as relational biology and relational computer science. The relationships between artifacts and their designers and users are of such primary importance that only a theory that is able to deal with those relationships directly appears to be sufficient for describing the wide breadth of problems in engineering design. However, there is no precise definition for what qualifies as a relational theory. In mathematics, we do find something approaching a theory of relations, dating back at least to Charles Peirce's <italic>Logic of Relatives</italic> around 1870. While rather general, Peirce's ideas on the subject laid the foundation for advances in the 20th century, including the relational model of databases. This paper is a first attempt at applying the mathematics of relations to affordances, with the aim of more precisely characterizing affordances, which heretofore have been difficult to define and, lacking appropriate mathematics, nearly impossible to subject to computation. Meanwhile, the implicit computability of affordances as relations is demonstrated by examples drawn from engineering, physics, computer science, biology, and architecture.</p> </abstract>