E-connections of abstract description systems

Kutz, O. and Lutz, C. and Wolter, F. and Zakharyaschev, Michael (2004) E-connections of abstract description systems. Artificial Intelligence 156 (1), pp. 1-73. ISSN 0004-3702.

Full text not available from this repository.

Official URL: https://doi.org/10.1016/j.artint.2004.02.002

Abstract

Combining knowledge representation and reasoning formalisms is an important and challenging task. It is important because non-trivial AI applications often comprise different aspects of the world, thus requiring suitable combinations of available formalisms modeling each of these aspects. It is challenging because the computational behavior of the resulting hybrids is often much worse than the behavior of their components. In this paper, we propose a new combination method which is computationally robust in the sense that the combination of decidable formalisms is again decidable, and which, nonetheless, allows non-trivial interactions between the combined components. The new method, called -connection, is defined in terms of abstract description systems (ADSs), a common generalization of description logics, many logics of time and space, as well as modal and epistemic logics. The basic idea of -connections is that the interpretation domains of n combined systems are disjoint, and that these domains are connected by means of n-ary ‘link relations’. We define several natural variants of -connections and study in-depth the transfer of decidability from the component systems to their -connections.

Metadata

Item Type:	Article
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	01 Nov 2021 13:03
Last Modified:	09 Aug 2023 12:52
URI:	https://eprints.bbk.ac.uk/id/eprint/46551

Statistics

Archive Staff Only (login required)

Edit/View Item