We study possibilities of combining (fragments) of the lightweight description logics FL0 and EL, and identify classes of subsumption problems in a combination of EL and Horn-FL0, which can be checked in PSPACE resp. PTIME. Since FL0 allows universal role restrictions and EL allows existential role restrictions, we thus have a framework where subsumption between expressions including both types...

We present the fuzzy description logic ALCFH where primitive concepts are modified by means of hedges taken from hedge algebras. ALCFH is strictly more expressive than Fuzzy-ALC defined in [9]. We show that given a linearly ordered set of hedges primitive concepts can be modified to any desired degree by prefixing them with appropriate chains of hedges. Furthermore, we define a decision procedu...

This paper discusses the decidability of determinacy and subsumption for tree transducers. For two tree transducers T1 and T2, T1 determines T2 if the output of T2 is identified by the output of T1, that is, there is a partial function f such that [[T2]] = f ◦ [[T1]] where [[T1]] and [[T2]] are tree transformation relations induced by T1 and T2, respectively. Also, T1 subsumes T2 if T1 determin...

In this paper we study the completeness of resolution when it is restricted by a non-liftable order and by weak subsumption. A non-liftable order is an order that does not satisfy A ≺ B ⇒ AΘ ≺ BΘ. Clause c1 weakly subsumes c2 if c1Θ ⊆ c2, and Θ is a renaming substitution. We show that it is natural to distinguish 2 types of non-liftable orders and 3 types of weak subsumption, which correspond n...

We investigate the word and the subsumption problem for recurrent term schematizations, which are a special type of constraints based on iteration. By means of uniication, we reduce these problems to a fragment of Presburger arithmetic. Our approach is applicable to all recurrent term schematizations having a nitary uniication algorithm. Furthermore, we study a particular form of the complement...

Tabling based systems use call similarity to decide when a tabled subgoal should produce or consume answers. Most tabling engines do that by using variant checks. A more refined method, named call subsumption, considers that a subgoal A will consume answers from a subgoal B if A is subsumed by B, thus allowing greater answer reuse. Recently, we have developed an extension, called Retroactive Ca...

XML data is often used validated stored queried etc with respect to di erent types Understanding the relationship between these types can provide important information for manipulating this data We propose a notion of subsumption for XML to capture such relation ships Subsumption relies on a syntactic mapping between types and can be used for facilitating validation and query processing We stud...

This paper describes the application of an organic programming language Gaea in programming complex and exible multi-agent systems. We consider a soccer game as an example. Using organic programming, we can program soccer players in an extended version of a subsumption architecture, called a dynamic subsumption architecture, which is more exible and eecient than the original one.

Modern explanatory ILP methods like Progol, Residue procedure, CF-induction, HAIL and Imparo use the principle of Inverse Entailment (IE). It is based on the fact that the negation of a hypothesis is derived from a prior background theory and the negation of examples. IE-based methods commonly compute a hypothesis in two steps: by first constructing an intermediate theory and next by generalizi...