We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...
Many computational problems linked to reasoning under uncertainty can be expressed in terms of computing the marginal(s) of the combination of a collection of (local) valuation fun...
Being able to extend an OWL ontology with some form of rules is a feature that many ontology developers consider as very important. Nevertheless, working with rules in practice can...
Birte Glimm, Matthew Horridge, Bijan Parsia, Peter...
Abstract. Making case adaptation practical is a longstanding challenge for casebased reasoning. One of the impediments to widespread use of automated case adaptation is the adaptat...
We consider type systems that combine universal types, recursive types, and object types. We study type inference in these systems under a rank restriction, following Leivant'...