We prove the completeness of the regular strategy of derivations for superposition-based calculi. The regular strategy was pioneered by Kanger in (Kan63), who proposed that all equality inferences take place before all other steps in the proof. We show that the strategy is complete with the redundancy notions of tautology elimination and subsumption. The implication of our result is the complet...

In order to support a wide range of planning-related activities, we argue that plan and action representations must move to a more expressive language for goals and capabilities than is found in most current systems. A structured representation for capabilities can make explicit a hierarchy of capabilities based on subsumption, resulting in benefits for reasoning, representing, and acquiring op...

We introduce a test, named π-subsumption, which computes partial subsumptions between a hypothesis h and an example e, as well as a measure, the subsumption index, which quantifies the covering degree between h and e. The behavior of this measure is studied on the phase transition problem.

The original SPARQL proposal was often criticized for its inability to navigate through the structure of RDF documents. For this reason property paths were introduced in SPARQL 1.1, but up to date there are no theoretical studies examining how their addition to the language affects main computational tasks such as query evaluation, query containment, and query subsumption. In this paper we tack...

Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing offers and requests and standard methods from description logics reasoning have been proposed for computing matches. We argue that classical reasoning is not well suited for realistic scenarios as it does not allow to co...

We introduce a feature structure, corresponding to a timespan tree based on ‘A Generative Theory of Tonal Music’ (GTTM) for a music piece, and represent the reduction of the tree by the subsumption among these feature structures. As the collection of them forms a lattice, we can define the join and meet operations. We show a melodic morphing algorithm based on these simple operations.