作者: Aldo Gangemi , Valentina Presutti
DOI: 10.1007/978-3-642-35843-2_8
关键词: Unary operation 、 Ontology-based data integration 、 Software design pattern 、 Variable (computer science) 、 Theoretical computer science 、 Axiom 、 Binary relation 、 Arity 、 Space (commercial competition) 、 Computer science
摘要: Within the broad area of knowledge pattern science, an important topic is discovery, description, and evaluation modeling patterns for a certain task. One most controversial problem constituted by relations with large or variable (polymorphic) arity. There indeed literature on representing n-ary in logical languages expressivity limited to unary binary relations, e.g. when time, space, roles other should be used as indexes relations. In this paper we provide comparison several design patterns, based their respective (dis)advantages, well axiomatic complexity. Data actual processing time queries DL reasoning from in-vitro study also provided.