Learn More
The Oz Programming Model (OPM) is a concurrent programming model subsuming higher-order functional and object-oriented programming as facets of a general model. This is particularly interesting for concurrent object-oriented programming, for which no comprehensive formal model existed until now. The model can be extended so that it can express encapsulated(More)
This paper presents a set description logic with subsorts, feature selection (the inverse of unary function application), agreement, intersection , union and complement. We deene a model theoretic open world semantics and show that sorted feature structures constitute a canon-ical model, that is, without loss of generality subsumption and consistency of set(More)
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system employed in Prolog II, where ner-grained constraints are used, and where subtrees are identiied by keywords rather than by position. CFT is deened by a rst-order structure consisting of(More)
This thesis presents Spartacus, a tableau-based reasoner for hybrid logic with global modalities and reflexive and transitive relations. To obtain termination in the presence of global modalities and transitive relations, Spartacus uses pattern-based blocking. To achieve a competitive performance on practical problems, we employ a range of optimization(More)
This thesis presents the foundations for relational logic programming over polymorphically order-sorted data types. This type discipline combines the notion of parametric polymorphism, which has been developed for higher-order functional programming, with the notion of order-sorted typing, which has been developed for equational rst-order speci cation and(More)
This paper studies feature description languages that have been developed for use in uniication grammars, logic programming and knowledge representation. The distinctive notational primitive of these languages are features that can be understood as unary partial functions on a domain of abstract objects. We show that feature description languages can be(More)