Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
422316 | Electronic Notes in Theoretical Computer Science | 2014 | 18 Pages |
Abstract
The method of connecting logics has gained a lot of attention in the knowledge representation and ontology communities because of its intuitive semantics and natural support for modular KR, its generality, and its robustness concerning decidability preservation. However, so far no dedicated automated reasoning solutions have been developed, and the only reasoning available was via translation into sufficiently expressive logics. In this paper, we present a simple modalised version of basic E-connections, and develop a sound, complete, and terminating resolution-based reasoning procedure. The approach is modular and can be extended to more expressive versions of E-connections.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics