Abstract
We present an extension to DL-based taxonomic reasoning by means of the proposedinference fusion, i.e. the dynamic combination of inferences from distributed heterogeneous reasoners. Our approach integrates results from a DL-based system with results from a constraint solver under the direction of a global reasoning coordinator.Inference fusion is performed by (i) processing heterogeneous input knowledge, producing suitable homogeneous input knowledge for each specialised reasoner; (ii) activating each reasoner when necessary, collecting its results and passing them to the other reasoner if appropriate; (iii) combining the results of the two reasoners. We discuss the benefits of our approach and demonstrate our ideas by proposing a language (DL(D)IS) and a reasoning system (Concor) which uses knowledge bases written in DL (D)/S and supports hybrid reasoning. We illustrate our ideas with an example.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F. Baader and P. Hanschke. A scheme for integrating concrete domains into concept languages. In Proc. of the 12th Intl. Joint Conf. on Artificial Intelligence (IJCAI’91), pages 452–457. Morgan Kaufmann, 1991.
F. Baader and U. Sattler. Description Logics with Symbolic Number Restrictions. In Proc. of the 12th European Conf. on Artificial Intelligence (ECAI’96), pages 283–287. John Wiley, 1996.
T. Berners-Lee, J. Hendler, and O. Lassila. The Semantic Web. Scientific American, pages 28–37, May 2001.
P. Brisset et al. ECLiPSe Constraint Library Manual, Rel. 5.2. International Computers Ltd. and Imperial College London, 2001.
E. Compatangelo and H. Meisel. K—ShaRe: an architecture for sharing heterogeneous conceptualisations. In Proc. of I-KOMAT—2002-to appear.
F.M. Donini et al. Reasoning in description logics. In Foundations of Knowledge Representation, pages 191–236. CSLI, 1996.
D. Fensel, F. van Harmelen, I. Horrocks, D. McGuinness, and P. Patel-Schneider. OIL: An Ontology Infrastructure for the Semantic Web. Intelligent Systems, 16 (2): 38 – 45, 2001.
A. FernĂ¡ndez and P.M. Hill. A Comparative Study of Eight Constraint Programming Languages over the Boolean and Finite Domains. Jour. of Constraints, 5: 275 – 301, 2000.
R. Fikes and A. Farquhar. Distributed Repositories of Highly Expressive Reusable Ontologies. Intelligent Systems, 14 (2): 73 – 79, 1999.
V. Haarslev, C. Lutz, and R. Möller. A description logic with concrete domains and role-forming predicates. Jour. of Logic and Computation, 9 (3): 351 – 384, 1999.
V. Haarslev and R. Möller. High Performance Reasoning with Very Large Knowledge Bases: A Practical Case Study. In Proc. of the 17th Intl. Joint Conf. on Artificial Intelligence (IJCAF’01), pages 161–168, 2001.
V. Haarslev, R. Möller, and A. Turhan. A Box reasoner: Progress report. In Proc. of the Intl. Workshop on Description Logics (DL’98), pages 82–86, 1998
I. Horrocks. FaCT and iFaCT. In Proc. of the Intl. Workshop on Description Logics (DL’99), pages 133–135, 1999.
I. Horrocks and U. Sattler. Ontology Reasoning in the SHOQ(D) Description Logic. In Proc. of the 17th Intl. Joint Conf. on Artificial Intelligence (IJCAI’01), pages 199–204. Morgan Kaufmann, 2001.
I. Horrocks, U. Sattler, and S. Tobies. Practical reasoning for very expressive description logics. Logic Journal of the IGPL, 8 (3): 239 – 263, 2000.
B. Hu, E. Compatangelo, and I. Arana. A hybrid approach to extend DL-based reasoning with concrete domains. In Proc. of the KI-2001 Workshop on Applications of Description Logics. CEUR Proceedings, 2001.
B. Hu, E. Compatangelo, and I. Arana. Coordinated reasoning with inference fusion. In Proc. of the KES-2002, Sixth Intl. Conf. on Knowledge-Based Intelligent Information & Engineering Systems. IOS Press, 2002. To appear.
J Jaffar and MJ. Maher. Constraint Logic Programming: A Survey. The Jour. of Logic Programming, 19 & 20:503–582, 1994.
C. Lutz. NExpTime-complete description logics with concrete domains. In Proc. of the Intl. Joint Conf. on Automated Reasoning, number 2083 in LNAI, pages 45–60. Springer-Verlag, 2001.
R. MacGregor, H. Chalupsky, and E.R. Melz. PowerLoom Manual. ISI, University of South California, 1997.
A.K. Mackworth and E.C. Freuder. The Complexity of Constraint Satisfaction Revisited. Artificial Intelligence, 59 (1–2): 57 – 62, 1993.
B. Nebel. What is hybrid in hybrid representation and reasoning systems? In Proc. of the 2nd Intl. Symp. on Computational Intelligence (CI’89), pages 217–228, 1989.
N.F. Noy, R.W. Fergerson, and M.A. Musen. The knowledge model of Protégé2000: Combining interoperability and flexibility. In Proc. of the 12th Intl. Conf. on Knowledge Engineering and Knowledge Management (EKAW’2000), 2000.
The Object Management Group OMG. OMG Unified Modeling Language Specification, March 2000. Available from http://www.omg.org/technology/documents/formal/uml.htm. http://www.omg.org/technology/documents/formal/uml.htm.
M. Schmidt-SchauĂŸ and G. Smolka. Attributive concept descriptions with complements. Artificial Intelligence, 48 (l): 1 – 26, 1991.
E.P.K. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag London Limited
About this paper
Cite this paper
Hu, B., Arana, I., Compatangelo, E. (2003). Facilitating DL-based Hybrid Reasoning with Inference Fusion. In: Bramer, M., Preece, A., Coenen, F. (eds) Research and Development in Intelligent Systems XIX. Springer, London. https://doi.org/10.1007/978-1-4471-0651-7_7
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0651-7_7
Publisher Name: Springer, London
Print ISBN: 978-1-85233-674-5
Online ISBN: 978-1-4471-0651-7
eBook Packages: Springer Book Archive