Abstract
Description logics are powerful knowledge representation systems providing well-founded and computationally tractable classification reasoning. However recognition of individuals as belonging to a concept based on some approximate match to a prototypical descriptor has been a recurring application issue as description logics support only strict subsumption reasoning. Expression of concepts as a disjunction of each possible combination of sufficient prototypical features has previously been infeasible due to computational cost. Recent optimisations have greatly improved disjunctive reasoning in description logic systems and this work explores whether these are sufficient to allow the heavy use of disjunction for approximate matching. The positive results obtained support further exploration of the representation proposed within real applications.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
F. Baader, E. Franconi, B. Hollunder, B. Nebel, and H.-J. Profitlich. An empirical analysis of optimization techniques for terminological representation systems or: Making KRIS get a move on. In Proc. of the 3rd Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR-92), pages 270–281, 1992.
F. Baader and B. Hollunder. KRIS: Knowledge representation and inference system. SIGART Bulletin, 2(3):8–14, 1991.
Franz Baader and Bernhard Hollunder. How to prefer more specific defaults in terminolog ical default logic. In Proc. of the 13th Int. Joint Conf. on Artificial Intelligence (IJCAI-93), pages 669–674, 1993.
A. B. Baker. Intelligent Backtracking on Constraint Satisfaction Problems: Experimental and Theoretical Results. PhD thesis, University of Oregon, 1995.
J. I. Berman, H. H. Moore IV, and J. R. Wright. CLASSIC and PROSE stories: Enabling technologies for knowledge based systems. AT&T Technical Journal, pages 69–78, January/February 1994.
P. Coupey and C. Fouquere. Extending conceptual definitions with default knowledge. Computational Intelligence, 13(2):258–299, 1997.
M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5:394–397, 1962.
G. De Giacomo and M. Lenzerini. TBox and ABox reasoning in expressive description logics. In Proc. of the 5th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR-96), pages 316–327, 1996.
F. Giunchiglia and R. Sebastiani. A SAT-based decision procedure for ALC. In Proc. of the 5th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR-96), pages 304–314, 1996.
J. Heinsohn, D. Kudenko, B. Nebel, and H.J. Profitlich. An empirical analysis of termi nological representation systems In Proc. of the 10th Nat. Conf. on Artificial Intelligence (AAAI-92), pages 676–773, 1992.
B. Hollunder. Algorithmic Foundations of Terminological Knowledge Representatin Systems. PhD thesis, Universität des Saarlandes, 1994.
B. Hollunder and W. Nutt. Subsumption algorithms for concept languages. In Proc. of the 9th European Conf. on Artificial Intelligence (ECAI-90), pages 348–353, 1990.
I. Horrocks. Optimising Tableaux Decision Procedures for Description Logics. PhD thesis, University of Manchester, 1997.
I. Horrocks. Using an expressive description logic: FaCT or fiction? In Proc. of the 6th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR-98), pages 636–647, 1998.
U. Hustadt and R. A. Schmidt. On evaluating decision procedures for modal logic. In Proc. of the 15th Int. Joint Conf. on Artificial Intelligence (IJCAI-97), volume 1, pages 202–207, 1997.
Lin Padgham. Defeasible inheritance: A lattice based approach. Computers and Mathematics with Applications, 23(6–9):527–541, 1992. Special Issue on Semantic Nets.
Lin Padgham and Bernhard Nebel. Combining classification and non-monotonic inheritance reasoning: A first step. In Proc. of the 7th Int. Sytn. on Methodologies for Intelligent Systems (ISMIS-93), pages 132–141, 1993. LNAI 689.
Lin Padgham and Tingting Zhang. A terminological logic with defaults: A definition and an application. In Proc. of the 13th Int. Joint Conf. on Artificial Intelligence (IJCAI-93), volume 2, pages 662–668, 1993.
E. Rosch. Cognitive representations of semantic categories. Journal of Experimental Psychology, 104, 1975.
R. M. Smullyan. First-Order Logic. Springer-Verlag, 1968.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Heidelberg Berlin
About this paper
Cite this paper
Horrocks, I., Padgham, L., Thomson, L. (1999). Feasibility of Optimised Disjunctive Reasoning for Approximate Matching. In: Foo, N. (eds) Advanced Topics in Artificial Intelligence. AI 1999. Lecture Notes in Computer Science(), vol 1747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46695-9_28
Download citation
DOI: https://doi.org/10.1007/3-540-46695-9_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66822-0
Online ISBN: 978-3-540-46695-6
eBook Packages: Springer Book Archive