The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Practical Reasoning for Expressive Description Logics
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A machine program for theorem-proving
Davis, M., Logemann, G., & Loveland, D. (1962) · Communications of the ACM · doi:10.1145/368273.368557 · Cited by 3,220
Propositional dynamic logic of regular programs
Fischer, M. J., & Ladner, R. E. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90046-1 · Cited by 1,193
Attributive concept descriptions with complements
Schmidt-Schauß, M., & Smolka, G. (1991) · Artificial Intelligence · doi:10.1016/0004-3702(91)90078-x · Cited by 962
Patel‐Schneider, P. F. (1998) · Cited by 531
TBox and ABox Reasoning in Expressive Description Logics.
Giacomo, G. D., & Lenzerini, M. (1996) · Cited by 164
Goals for concept representation in the GALEN project.
Rector, A. L., Nowlan, W. A., & Glowinski, A. (1993) · PubMed · Cited by 125
HARP: A tableau-based theorem prover
Oppacher, F., & Suen, E. (1988) · Journal of Automated Reasoning · doi:10.1007/bf00244513 · Cited by 91
On the expressivity of feature logics with negation, functional uncertainty, and sort equations
Baader, F., Bürckert, H.-J., Nebel, B., Nutt, W., & Smolka, G. (1991) · doi:10.22028/d291-24990 · Cited by 68
A Unified Framework for Class-Based Representation Formalisms
Calvanese, D., Maurizio Lenzerini, B., & Nardi, D. (1994) · Principles of Knowledge Representation and Reasoning · doi:10.1016/b978-1-4832-1452-8.50107-x · Cited by 67
Cited by
Managing uncertainty and vagueness in description logics for the Semantic Web
Lukasiewicz, T., & Straccia, U. (2008) · Journal of Web Semantics · doi:10.1016/j.websem.2008.04.001 · Cited by 473
OilEd: A Reason-able Ontology Editor for the Semantic Web
Bechhofer, S., Horrocks, I., Goble, C., & Stevens, R. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45422-5_28 · Cited by 393
Self-citationOntology‐based activity recognition in intelligent pervasive environments
Chen, L., & Nugent, C. (2009) · International Journal of Web Information Systems · doi:10.1108/17440080911006199 · Cited by 253
Metadata
- Authors
- Horrocks, I., Sattler, U., & Tobies, S.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1999
- Pages
- 161-180
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1982030536
- Cited by
- 532
- References
- 9
- FWCI
- 23.77
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Practical Reasoning for Expressive Description Logics. https://app.cochat.ai/papers/10.1007/3-540-48242-3_11
- The paper
- Horrocks, I., Sattler, U., & Tobies, S. (1999). Practical Reasoning for Expressive Description Logics. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-48242-3_11
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
