A framework in prolog for computing structural relationships

Authors:
Carsten Pontow;Florian Dazinger;Rainer Schubert
Affiliations:
Institute for Biomedical Image Analysis, University for Health Sciences, Medical Informatics and Technology (UMIT), Eduard Wallnöfer-Zentrum I, A-6060 Hall in Tyrol, Austria;Institute for Biomedical Image Analysis, University for Health Sciences, Medical Informatics and Technology (UMIT), Eduard Wallnöfer-Zentrum I, A-6060 Hall in Tyrol, Austria;Institute for Biomedical Image Analysis, University for Health Sciences, Medical Informatics and Technology (UMIT), Eduard Wallnöfer-Zentrum I, A-6060 Hall in Tyrol, Austria
Venue:
Data & Knowledge Engineering
Year:
2007

Citing 8
Cited 0

Parts, wholes, and part-whole relations: the prospects of mereotopology

Data & Knowledge Engineering - Special issue on modeling parts and wholes
Mereotopology: a theory of parts and boundaries

Data & Knowledge Engineering - Special issue on modeling parts and wholes
Part-whole relations in object-centered systems: an overview

Data & Knowledge Engineering - Special issue on modeling parts and wholes
Formalization of the Whole-Part Relationship in the Unified Modeling Language

IEEE Transactions on Software Engineering
What is This Thing Called Aggregation?

TOOLS '99 Proceedings of the Technology of Object-Oriented Languages and Systems
A note on the axiomatics of theories in parthood

Data & Knowledge Engineering
A mathematical analysis of theories of parthood

Data & Knowledge Engineering
Black and white diamonds

UML'99 Proceedings of the 2nd international conference on The unified modeling language: beyond the standard

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a low-level Prolog framework for computing structural relationships in finite models of General Extensional Mereology (GEM), which is probably the most prominent predicate logic theory of parthood. Based on a minimal amount of structural input knowledge about a domain the framework generates a consistent model of parthood and other structural relations and functions on the entities of that domain. Although some of its algorithms have exponential time complexity, the framework may contribute to the generation of consistent models of structural knowledge in various domains.