Philipp Hanschke. A declarative integration of terminological, constraint-based, data-driven, and goal-directed reasoning. Deutsches Forschungszentrum fur Kunstliche Intelligenz: Research Reports; RR-93-46. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Analyzing configuration systems with description logics: A .. - Möller, Schröder, Lutz (1997) (Correct)
....that apply to a particular world model. Assertional reasoners support a query language in order to access stated and deduced constraints. Some query languages o#er the expressiveness of the full first order calculus. 2.2. 2 The Concrete Domain Baader and Hanschke [ Baader Hanschke 1991, Hanschke 1993 ] have explored the idea of separating the domain of a description logic into an abstract and a concrete part. A DL with a concrete domain extends a standard DL by adding predicates and individuals for the concrete domain. The predicates can be used to define new concepts in the abstract domain. ....
.... domain (see below) Basically, i) the set of predicate names defined by a concrete domain has to be closed under negation and has to contain a predicate name for domain membership, and (ii) the satisfiability problem for finite conjunctions of corresponding predicates has to be decidable (see [ Hanschke 1993 ] for a detailed definition) Another approach for integrating other domains into description logics has been proposed by [ Borgida et al. 1996 ] This approach is specific to the description logic CLASSIC [ Borgida et al. 1989 ] which as we will see in the following sections is not ....
[Article contains additional citation context not shown here]
Philipp Hanschke. A declarative integration of terminological, constraint-based, data-driven, and goal-directed reasoning. Deutsches Forschungszentrum fur Kunstliche Intelligenz: Research Reports; RR-93-46.
A Partial Logical Reconstruction of PLAKON/KONWERK - Schröder, Möller, Lutz (1996) (1 citation) (Correct)
....to actually represent the star can be created using a rule. The vertex v4 can be seen as a representative for the star and Middle Vertex can be used in the antecedent part of the rule. A semantics for rules with epistemic operators and the use of rules to create aggregates is defined in [ Hanschke 1993 ] Hanschke [ 1993 ] also introduces transitive closure as an extension to role specifications. Transitive closures are required e.g. to represent polylines. Transitive closures are also required to augment the task specification in Plakon and Konwerk. We have seen that one main goal object and a ....
....represent the star can be created using a rule. The vertex v4 can be seen as a representative for the star and Middle Vertex can be used in the antecedent part of the rule. A semantics for rules with epistemic operators and the use of rules to create aggregates is defined in [ Hanschke 1993 ] Hanschke [ 1993 ] also introduces transitive closure as an extension to role specifications. Transitive closures are required e.g. to represent polylines. Transitive closures are also required to augment the task specification in Plakon and Konwerk. We have seen that one main goal object and a set of additional ....
Philipp Hanschke. A Declarative Integration of Terminological, Constraintbased, Data-driven, and Goal-directed Reasoning. DFKI Research Report RR-93-46, Deutsches Forschungszentrum fur Kunstliche Intelligenz, Kaiserslautern, October 1993.
A Partial Logical Reconstruction of PLAKON/KONWERK - Schröder, Möller, Lutz (1996) (1 citation) (Correct)
....Therefore, all edges are End Edges and v4 is a Star Middle Vertex. The vertex v4 can be seen as a representative for the star. An aggregate to actually represent the star can be created using a rule. A semantics for rules with epistemic operators is defined in [ Donini et al. 1992 ] and [ Hanschke 1993 ] The use of rules to create aggregates is presented in [ Hanschke 1993 ] Hanschke [ 1993 ] also introduces extensions to represent polylines. The quintessence is that graph structures in general can be represented with description logics. However, for recognizing specific graph structures, ....
....The vertex v4 can be seen as a representative for the star. An aggregate to actually represent the star can be created using a rule. A semantics for rules with epistemic operators is defined in [ Donini et al. 1992 ] and [ Hanschke 1993 ] The use of rules to create aggregates is presented in [ Hanschke 1993 ] Hanschke [ 1993 ] also introduces extensions to represent polylines. The quintessence is that graph structures in general can be represented with description logics. However, for recognizing specific graph structures, adequate concepts (and possibly subrelations) must be defined. That is ....
[Article contains additional citation context not shown here]
Philipp Hanschke. A Declarative Integration of Terminological, Constraintbased, Data-driven, and Goal-directed Reasoning. DFKI Research Report RR-93-46, Deutsches Forschungszentrum fur Kunstliche Intelligenz, Kaiserslautern, October 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC