Results 1 - 10
of
31,932
Description Logic Knowledge and Action Bases
, 2013
"... Description logic Knowledge and Action Bases (KAB) are a mechanism for providing both a semantically rich representation of the information on the domain of interest in terms of a description logic knowledge base and actions to change such information over time, possibly introducing new objects. We ..."
Abstract
-
Cited by 19 (9 self)
- Add to MetaCart
Description logic Knowledge and Action Bases (KAB) are a mechanism for providing both a semantically rich representation of the information on the domain of interest in terms of a description logic knowledge base and actions to change such information over time, possibly introducing new objects. We
When Are Description Logic Knowledge Bases Indistinguishable?∗
"... Deciding inseparability of description logic knowl-edge bases (KBs) with respect to conjunctive queries is fundamental for many KB engineering and maintenance tasks including versioning, mod-ule extraction, knowledge exchange and forget-ting. We study the combined and data complex-ity of this insepa ..."
Abstract
- Add to MetaCart
Deciding inseparability of description logic knowl-edge bases (KBs) with respect to conjunctive queries is fundamental for many KB engineering and maintenance tasks including versioning, mod-ule extraction, knowledge exchange and forget-ting. We study the combined and data complex-ity
Usability issues in description logic knowledge base completion
- IN: ICFCA-2009
, 2009
"... In a previous paper, we have introduced an approach for extending both the terminological and the assertional part of a Description Logic knowledge base by using information provided by the assertional part and by a domain expert. This approach, called knowledge base completion, was based on an exte ..."
Abstract
-
Cited by 7 (2 self)
- Add to MetaCart
In a previous paper, we have introduced an approach for extending both the terminological and the assertional part of a Description Logic knowledge base by using information provided by the assertional part and by a domain expert. This approach, called knowledge base completion, was based
Games for Query Inseparability of Description Logic Knowledge Bases
"... We consider conjunctive query inseparability of description logic knowledge bases with respect to a given signature— a fundamental problem in knowledge base versioning, module extraction, forgetting and knowledge exchange. We give a uniform game-theoretic characterisation of knowledge base conjuncti ..."
Abstract
- Add to MetaCart
We consider conjunctive query inseparability of description logic knowledge bases with respect to a given signature— a fundamental problem in knowledge base versioning, module extraction, forgetting and knowledge exchange. We give a uniform game-theoretic characterisation of knowledge base
Verification of Description Logic Knowledge and Action Bases
, 2012
"... doi:10.3233/978-1-61499-098-7-103 ..."
Completing description logic knowledge bases using formal concept analysis
- In Proc. of IJCAI 2007
, 2007
"... We propose an approach for extending both the terminological and the assertional part of a Description Logic knowledge base by using information provided by the knowledge base and by a domain expert. The use of techniques from Formal Concept Analysis ensures that, on the one hand, the interaction wi ..."
Abstract
-
Cited by 80 (7 self)
- Add to MetaCart
We propose an approach for extending both the terminological and the assertional part of a Description Logic knowledge base by using information provided by the knowledge base and by a domain expert. The use of techniques from Formal Concept Analysis ensures that, on the one hand, the interaction
E.: Exchanging description logic knowledge bases
- In: Proc. of KR 2012
, 2012
"... In this paper, we study the problem of exchanging knowledge between a source and a target knowledge base (KB), connected through mappings. Differently from the traditional database exchange setting, which considers only the exchange of data, we are interested in exchanging implicit knowledge. As rep ..."
Abstract
-
Cited by 11 (9 self)
- Add to MetaCart
. As representation formalism we use Description Logics (DLs), thus assuming that the source and target KBs are given as a DL TBox+ABox, while the mappings have the form of DL TBox assertions. We study the problem of translating the knowledge in the source KB according to these mappings. We define a general framework
Verification of Description Logic Knowledge and Action Bases
"... Abstract. We introduce description logic (DL) Knowledge and Action Bases (KAB), a mechanism that provides both a semantically rich representation of the information on the domain of interest in terms of a DL KB and a set of actions to change such information over time, possibly introducing new objec ..."
Abstract
-
Cited by 8 (2 self)
- Add to MetaCart
Abstract. We introduce description logic (DL) Knowledge and Action Bases (KAB), a mechanism that provides both a semantically rich representation of the information on the domain of interest in terms of a DL KB and a set of actions to change such information over time, possibly introducing new
M.: Query inseparability for description logic knowledge bases
- In: Proc. of the 14th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2014). AAAI Press
, 2014
"... We investigate conjunctive query inseparability of description logic (DL) knowledge bases (KBs) with respect to a given signature, a fundamental problem for KB versioning, module extraction, forgetting and knowledge exchange. We study the data and combined complexity of deciding KB query insep-arabi ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
We investigate conjunctive query inseparability of description logic (DL) knowledge bases (KBs) with respect to a given signature, a fundamental problem for KB versioning, module extraction, forgetting and knowledge exchange. We study the data and combined complexity of deciding KB query insep
An approach to exploring description logic knowledge bases
- Proceedings of the 8th International Conference on Formal Concept Analysis, (ICFCA 2010), volume 5986 of Lecture Notes in Artificial Intelligence
, 2010
"... Abstract. This paper is the successor to two previous papers published at the ICFCA conference. In the first paper we have shown that in the Description Logics EL and ELgfp, the set of general concept inclusions holding in a finite model always has a finite basis. An exploration for-malism that can ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract. This paper is the successor to two previous papers published at the ICFCA conference. In the first paper we have shown that in the Description Logics EL and ELgfp, the set of general concept inclusions holding in a finite model always has a finite basis. An exploration for-malism that can
Results 1 - 10
of
31,932