ABox Abduction in the Description Logic ALC. Klarman, S., Endriss, U., & Schlobach, K. Journal of Automated Reasoning, Springer Netherlands, 2010. doi abstract bibtex Due to the growing popularity of Description Logics-based knowledge representation systems, predominantly in the context of Semantic Web applications, there is a rising demand for tools offering non-standard reasoning services. One particularly interesting form of reasoning, both from the user as well as the ontology engineering perspective, is abduction. In this paper we introduce two novel reasoning calculi for solving ABox abduction problems in the Description Logic ALC, i.e. problems of finding minimal sets of ABox axioms, which when added to the knowledge base enforce entailment of a requested set of assertions. The algorithms are based on regular connection tableaux and resolution with set-of-support and are proven to be sound and complete. We elaborate on a number of technical issues involved and discuss some practical aspects of reasoning with the methods. © 2010 Springer Science+Business Media B.V.
@article{f557113ad6ec4bc99412963bab9f630d,
title = "ABox Abduction in the Description Logic ALC",
abstract = "Due to the growing popularity of Description Logics-based knowledge representation systems, predominantly in the context of Semantic Web applications, there is a rising demand for tools offering non-standard reasoning services. One particularly interesting form of reasoning, both from the user as well as the ontology engineering perspective, is abduction. In this paper we introduce two novel reasoning calculi for solving ABox abduction problems in the Description Logic ALC, i.e. problems of finding minimal sets of ABox axioms, which when added to the knowledge base enforce entailment of a requested set of assertions. The algorithms are based on regular connection tableaux and resolution with set-of-support and are proven to be sound and complete. We elaborate on a number of technical issues involved and discuss some practical aspects of reasoning with the methods. © 2010 Springer Science+Business Media B.V.",
author = "S. Klarman and U. Endriss and K.S. Schlobach",
year = "2010",
doi = "10.1007/s10817-010-9168-z",
journal = "Journal of Automated Reasoning",
issn = "0168-7433",
publisher = "Springer Netherlands",
}
Downloads: 0
{"_id":"j7DiRsQ8qQhJE5ctM","bibbaseid":"klarman-endriss-schlobach-aboxabductioninthedescriptionlogicalc-2010","downloads":0,"creationDate":"2017-06-06T19:13:39.566Z","title":"ABox Abduction in the Description Logic ALC","author_short":["Klarman, S.","Endriss, U.","Schlobach, K."],"year":2010,"bibtype":"article","biburl":"https://raw.githubusercontent.com/KRRVU/website/master/publications/krr.bib","bibdata":{"bibtype":"article","type":"article","title":"ABox Abduction in the Description Logic ALC","abstract":"Due to the growing popularity of Description Logics-based knowledge representation systems, predominantly in the context of Semantic Web applications, there is a rising demand for tools offering non-standard reasoning services. One particularly interesting form of reasoning, both from the user as well as the ontology engineering perspective, is abduction. In this paper we introduce two novel reasoning calculi for solving ABox abduction problems in the Description Logic ALC, i.e. problems of finding minimal sets of ABox axioms, which when added to the knowledge base enforce entailment of a requested set of assertions. The algorithms are based on regular connection tableaux and resolution with set-of-support and are proven to be sound and complete. We elaborate on a number of technical issues involved and discuss some practical aspects of reasoning with the methods. © 2010 Springer Science+Business Media B.V.","author":[{"firstnames":["S."],"propositions":[],"lastnames":["Klarman"],"suffixes":[]},{"firstnames":["U."],"propositions":[],"lastnames":["Endriss"],"suffixes":[]},{"firstnames":["K.S."],"propositions":[],"lastnames":["Schlobach"],"suffixes":[]}],"year":"2010","doi":"10.1007/s10817-010-9168-z","journal":"Journal of Automated Reasoning","issn":"0168-7433","publisher":"Springer Netherlands","bibtex":"@article{f557113ad6ec4bc99412963bab9f630d,\n title = \"ABox Abduction in the Description Logic ALC\",\n abstract = \"Due to the growing popularity of Description Logics-based knowledge representation systems, predominantly in the context of Semantic Web applications, there is a rising demand for tools offering non-standard reasoning services. One particularly interesting form of reasoning, both from the user as well as the ontology engineering perspective, is abduction. In this paper we introduce two novel reasoning calculi for solving ABox abduction problems in the Description Logic ALC, i.e. problems of finding minimal sets of ABox axioms, which when added to the knowledge base enforce entailment of a requested set of assertions. The algorithms are based on regular connection tableaux and resolution with set-of-support and are proven to be sound and complete. We elaborate on a number of technical issues involved and discuss some practical aspects of reasoning with the methods. © 2010 Springer Science+Business Media B.V.\",\n author = \"S. Klarman and U. Endriss and K.S. Schlobach\",\n year = \"2010\",\n doi = \"10.1007/s10817-010-9168-z\",\n journal = \"Journal of Automated Reasoning\",\n issn = \"0168-7433\",\n publisher = \"Springer Netherlands\",\n}\n\n\n","author_short":["Klarman, S.","Endriss, U.","Schlobach, K."],"key":"f557113ad6ec4bc99412963bab9f630d","id":"f557113ad6ec4bc99412963bab9f630d","bibbaseid":"klarman-endriss-schlobach-aboxabductioninthedescriptionlogicalc-2010","role":"author","urls":{},"metadata":{"authorlinks":{}},"downloads":0},"search_terms":["abox","abduction","description","logic","alc","klarman","endriss","schlobach"],"keywords":[],"authorIDs":[],"dataSources":["H6xuGqu5uQ6rXhdJ4","dJmTXpbSWWjnxatYT"]}