Víctor Gutiérrez-Basulto

Learn More
We propose a family of probabilistic description logics (DLs) that are derived in a principled way from Halpern’s probabilistic first-order logic. The resulting probabilistic DLs have a two-dimensional semantics similar to temporal DLs and are well-suited for representing subjective probabilities. We carry out a detailed study of reasoning in the new family(More)
We develop a novel description logic (DL) for representing and reasoning with contextual knowledge. Our approach descends from McCarthy’s tradition of treating contexts as formal objects over which one can quantify and express first-order properties. As a foundation we consider several common product-like combinations of DLs with multimodal logics and adopt(More)
Establishing a generic approach to representing and querying temporal data in the context of Description Logics (DLs) is an important, and still open challenge. The difficulty lies in that a proposed approach should reconcile a number of valuable contributions coming from diverse, yet relevant research lines, such as temporal databases and query answering(More)
We study probabilistic variants of the description logic EL. For the case where probabilities apply only to concepts, we provide a careful analysis of the borderline between tractability and EXPTIME-completeness. One outcome is that any probability value except zero and one leads to intractability in the presence of general TBoxes, while this is not the(More)
We study branching-time temporal description logics (BTDLs) based on the temporal logic CTL in the presence of rigid (time-invariant) roles and general TBoxes. There is evidence that, if full CTL is combined with the classical ALC in this way, reasoning becomes undecidable. In this paper, we begin by substantiating this claim, establishing undecidability(More)
We introduce Description Logics of Context (DLCs) — an extension of Description Logics (DLs) for context-based reasoning. Our approach descends from J. McCarthy’s tradition of treating contexts as formal objects over which one can quantify and express first-order properties. DLCs are founded in two-dimensional possible world semantics, where one dimension(More)
We study branching-time temporal description logics (TDLs) based on the DLsALC and EL and the temporal logics CTL and CTL∗. The main contributions are algorithms for satisfiability that are more direct than existing approaches, and (mostly) tight elementary complexity bounds that range from PTIME to 2EXPTIME and 3EXPTIME. A careful use of tree automata(More)
Description Logics (DLs) provide a clear and broadly accepted paradigm for modeling and reasoning about terminological knowledge. However, it has been often noted, that although DLs are well-suited for representing a single, global viewpoint on an application domain, they offer no formal grounding for dealing with knowledge pertaining to multiple(More)
While conjunctive query (CQ) answering over DL-Lite has been studied extensively, there have been few attempts to analyse CQs with negated atoms. This paper deepens the study of the problem. Answering CQs with safe negation and CQs with a single inequality over DL-Lite with role inclusions is shown to be undecidable, even for a fixed TBox and query. Without(More)
We study temporal description logics (TDLs) based on the branching-time temporal logic CTL and the lightweight DL EL in the presence of rigid roles and restricted TBoxes. While TDLs designed in this way are known to be inherently nonelementary or even undecidable over general TBoxes, there is hope for a better computational behaviour over acyclic or empty(More)