A framework in prolog for computing structural relationships

摘要

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.