Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Symbolic Arithmetical Reasoning with Qualified Number Restrictions

MPG-Autoren
/persons/resource/persons45140

Ohlbach,  Hans Jürgen
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45401

Schmidt,  Renate A.
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44660

Hustadt,  Ullrich
Programming Logics, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine externen Ressourcen hinterlegt
Volltexte (beschränkter Zugriff)
Für Ihren IP-Bereich sind aktuell keine Volltexte freigegeben.
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte in PuRe verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Ohlbach, H. J., Schmidt, R. A., & Hustadt, U. (1995). Symbolic Arithmetical Reasoning with Qualified Number Restrictions. In A. Borgida, M. Lenzerini, D. Nardi, & B. Nebel (Eds.), Proceedings of International Workshop on Description Logics 1995 (pp. 89-95). Rome: Dipartimento di Informatica e Sistemistica, Univ. degli studia di Roma.


Zitierlink: https://hdl.handle.net/11858/00-001M-0000-0014-AD27-5
Zusammenfassung
Many inference systems used for concept description logics are
constraint systems that employ tableaux methods.
These have the disadvantage that for reasoning with qualified number
restrictions $n$ new constant symbols are generated for each
concept of the form $(\geq n \ R \ C)$.
In this paper we present an alternative method that avoids the
generation of constants and uses a restricted form of symbolic
arithmetic considerably different from the tableaux method.
The method we use is introduced in
Ohlbach, Schmidt and Hustadt (1995) for reasoning with graded
modalities.
We exploit the exact correspondence between the concept description
language $\cal ALCN$ and the multi-modal version of the
graded modal logic $\overline{\mbox{\bf K}}$ and show how the method
can be applied to $\cal ALCN$ as well.

This paper is a condensed version of Ohlbach et al.\ (1995).
We omit proofs and much of the technical details, but we
include some examples.