Reference Citation Analysis: Find an Article, Find a Category, Find a Journal, Find a Scholar

For:	Bonatti PA, Lutz C, Wolter F. The Complexity of Circumscription in DLs. J ARTIF INTELL RES 2009. [DOI: 10.1613/jair.2763] [Citation(s) in RCA: 47] [Impact Index Per Article: 3.1] [Reference Citation Analysis] [What about the content of this article? (0)] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/04/2022] Open

Number

Cited by Other Article(s)

Schneider T, Šimkus M. Ontologies and Data Management: A Brief Survey. KUNSTLICHE INTELLIGENZ 2020;34:329-353. [PMID: 32999532 PMCID: PMC7497697 DOI: 10.1007/s13218-020-00686-3] [Citation(s) in RCA: 7] [Impact Index Per Article: 1.8] [Reference Citation Analysis] [Abstract] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 06/25/2020] [Accepted: 07/22/2020] [Indexed: 11/30/2022]

Varzinczak I. Defeasible Description Logics. KUNSTLICHE INTELLIGENZ 2020. [DOI: 10.1007/s13218-020-00649-8] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/27/2022]

Lieto A, Pozzato GL. A description logic framework for commonsense conceptual combination integrating typicality, probabilities and cognitive heuristics. J EXP THEOR ARTIF IN 2019. [DOI: 10.1080/0952813x.2019.1672799] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/25/2022]

A polynomial Time Subsumption Algorithm for Nominal SafeELO⊥under Rational Closure. Inf Sci (N Y) 2019. [DOI: 10.1016/j.ins.2018.09.037] [Citation(s) in RCA: 12] [Impact Index Per Article: 2.4] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/17/2022]

Rational closure for all description logics. ARTIF INTELL 2019. [DOI: 10.1016/j.artint.2019.04.001] [Citation(s) in RCA: 7] [Impact Index Per Article: 1.4] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/18/2022]

Pozzato GL. Typicalities and probabilities of exceptions in nonmotonic Description Logics. Int J Approx Reason 2019. [DOI: 10.1016/j.ijar.2019.02.003] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/29/2022]

On the logical properties of the nonmonotonic description logicDLN. ARTIF INTELL 2017. [DOI: 10.1016/j.artint.2017.04.001] [Citation(s) in RCA: 10] [Impact Index Per Article: 1.4] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/21/2022]

Lamy JB. Owlready: Ontology-oriented programming in Python with automatic classification and high level constructs for biomedical ontologies. Artif Intell Med 2017;80:11-28. [DOI: 10.1016/j.artmed.2017.07.002] [Citation(s) in RCA: 55] [Impact Index Per Article: 7.9] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/18/2017] [Revised: 07/04/2017] [Accepted: 07/06/2017] [Indexed: 10/19/2022]

Pozzato GL. Reasoning about plausible scenarios in Description Logics of typicality. INTELLIGENZA ARTIFICIALE 2017. [DOI: 10.3233/ia-170105] [Citation(s) in RCA: 9] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/15/2022]

Eiter T, Fink M, Stepanova D. Data repair of inconsistent nonmonotonic description logic programs. ARTIF INTELL 2016. [DOI: 10.1016/j.artint.2016.06.003] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/16/2022]

Bastiaanse H, Veltman F. Making the right exceptions. ARTIF INTELL 2016. [DOI: 10.1016/j.artint.2016.05.005] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/21/2022]

Semantic characterization of rational closure: From propositional logic to description logics. ARTIF INTELL 2015. [DOI: 10.1016/j.artint.2015.05.001] [Citation(s) in RCA: 51] [Impact Index Per Article: 5.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/22/2022]

Bonatti P, Faella M, Petrova I, Sauro L. A new semantics for overriding in description logics. ARTIF INTELL 2015. [DOI: 10.1016/j.artint.2014.12.010] [Citation(s) in RCA: 36] [Impact Index Per Article: 4.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/17/2022]

Konev B, Lutz C, Walther D, Wolter F. Model-theoretic inseparability and modularity of description logic ontologies. ARTIF INTELL 2013. [DOI: 10.1016/j.artint.2013.07.004] [Citation(s) in RCA: 35] [Impact Index Per Article: 3.2] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/29/2022]

A non-monotonic Description Logic for reasoning about typicality. ARTIF INTELL 2013. [DOI: 10.1016/j.artint.2012.10.004] [Citation(s) in RCA: 59] [Impact Index Per Article: 5.4] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/24/2022]