The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Abstract. We study termination of logic programs with dynamic scheduling, as it can be realised using delay declarations. Following previous work, our minimum assumption is that de...
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large a...
Alessandro Artale, Diego Calvanese, Roman Kontchak...
The semantics of class-based languages can be defined in terms of objects only [8, 7, 1] if classes are viewed as objects with a constructor method. One obtains a store in which m...
Abstract. We introduce a semi-automated proof system for basic category-theoretic reasoning. It is based on a first-order sequent calculus that captures the basic properties of cat...