(Enter summary)
Abstract: . Recently, concept logics have been proposed which
allow one to incorporate algorithms for domain specific problem
solving into the classical resolution principle. The domain
specific knowledge can be expressed by using the (KL-ONE
like) knowledge representation language ALC, and problems
are encoded by sets of so-called constrained clauses. Testing
satisfiability and validity of the thereby used ALC-constraints
are decidable.
In this paper we will show that things become much more
complex if ... (Update)
Context of citations to this paper: More
.... In the above example we would obtain the constrained clause p(x; z) jj x : Gamma 1 y : Gamma 2 z = f(y) For details on both topics see [5]. Note that because of the unfolding RQ formulas can directly be translated into a set of constrained clauses but not vice versa. 2...
Cited by: More
Concept Logics with Function Symbols - Bürckert, Hollunder, Laux (1994)
(Correct)
Active bibliography (related documents): More All
0.5: A Multi-Dimensional Terminological Knowledge.. - Franz Baader, Hans.. (1995)
(Correct)
0.2: Prefixed Tableaux Systems for Modal Logics with Enriched.. - Balbiani, Demri (1997)
(Correct)
0.2: A Reified Temporal Logic For Nonlinear Planning - Zhang, Barringer (1992)
(Correct)
Similar documents based on text: More All
0.3: Task Acquisition with a Description Logic Reasoner - Buchheit, Bürckert.. (1995)
(Correct)
0.2: International Workshop on Description Logics - Borgida, Lenzerini, Nardi, Nebel (1995)
(Correct)
0.2: Modal Description Logics: Modalizing Roles - Wolter, Zakharyaschev (1999)
(Correct)
BibTeX entry: (Update)
H.-J. Burckert, B. Hollunder, and A. Laux, `Concept logics with function symbols', Research Report RR-93-07, DFKI Saarbrucken, (1993). http://citeseer.ist.psu.edu/article/burckert94concept.html More
@inproceedings{ burckert94concept,
author = "Hans-Jurgen Burckert and Bernhard Hollunder and Armin Laux",
title = "Concept Logics with Function Symbols",
booktitle = "European Conference on Artificial Intelligence",
pages = "406-410",
year = "1994",
url = "citeseer.ist.psu.edu/article/burckert94concept.html" }
Citations (may not include all citations):
130
A scheme for integrating concrete domains into concept langu..
- Baader, Hanschke - 1991
49
Computational Aspects of an OrderSorted Logic with Term Decl.. (context) - Schmidt-Schauss - 1989
44
Definite relations over constraint languages
- Hohfeld, Smolka - 1988
29
Hybrid inferences in KL-ONE-based knowledge representation s.. (context) - Hollunder - 1990
22
A Resolution Principle for a Logic with Restricted Quantifie.. (context) - Burckert - 1991
16
A many-sorted unification (context) - Walther - 1988
10
Concept logics
- Baader, Burckert et al. - 1990
10
A general framework for sorted deduction: Fundamental result.. (context) - Frisch - 1989
7
A Resolution Principle for Constrained Logics (context) - Burckert - 1994
6
A many sorted logic with possibly empty sorts (context) - Cohn - 1992
4
A constraint logic approach to modal deduction (context) - Frisch, Scherl - 1990
2
Integrating a modal logic of knowledge into terminological l.. (context) - Laux - 1992
1
Concept logics with function symbols
- Burckert, Hollunder et al. - 1993
1
On skolemization in logics with constraints (context) - Burckert, Hollunder et al. - 1993
Documents on the same site (http://www.dfki.de/~tacos/TACOS-Publications.html): More
The Complexity of Existential Quantification in.. - Donini, Hollunder.. (1992)
(Correct)
Combination Problems for Commutative/Monoidal Theories or How.. - Baader, Nutt (1996)
(Correct)
Tractable Reasoning in a Universal Description Logic (Extended.. - Schild (1994)
(Correct)
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