activity
20152023
most citedFuzzy Answer Set Computation via Satisfiability Modulo Theories

6 citations · 18 across the 18 of their papers we have counts for

collaborators
Showing cs.LOShow all

12 papers · 1 filter

cs.LO2021

Union and Intersection of all Justifications

Jieying Chen, Yue Ma, Rafael Peñaloza +1

We present new algorithm for computing the union and intersection of all justifications for a given ontological consequence without first computing the set of all justifications. T…

cs.LO2021★ 1 cited

An Upper Bound for Provenance in ELHr

Rafael Peñaloza

We investigate the entailment problem in ELHr ontologies annotated with provenance information. In more detail, we show that subsumption entailment is in NP if provenance is repres…

cs.LO2020

The Probabilistic Description Logic

Leonard Botha, Thomas Meyer, Rafael Peñaloza

Description logics (DLs) are well-known knowledge representation formalisms focused on the representation of terminological knowledge. Due to their first-order semantics, these lan…

cs.LO2020

Reasoning with Contextual Knowledge and Influence Diagrams

Erman Acar, Rafael Peñaloza

Influence diagrams (IDs) are well-known formalisms extending Bayesian networks to model decision situations under uncertainty. Although they are convenient as a decision theoretic…

cs.LO2020

Axiom Pinpointing

Rafael Peñaloza

Axiom pinpointing refers to the task of finding the specific axioms in an ontology which are responsible for a consequence to follow. This task has been studied, under different na…

cs.LO2020

Provenance for the Description Logic ELHr

Camille Bourgaux, Ana Ozaki, Rafael Peñaloza +1

We address the problem of handling provenance information in ELHr ontologies. We consider a setting recently introduced for ontology-based data access, based on semirings and exten…

cs.LO2019★ 2 cited

Temporal Logics Over Finite Traces with Uncertainty (Technical Report)

Fabrizio M. Maggi, Marco Montali, Rafael Peñaloza

Temporal logics over finite traces have recently seen wide application in a number of areas, from business process modelling, monitoring, and mining to planning and decision making…

cs.LO2018★ 1 cited

Cutting Diamonds: Temporal DLs with Probabilistic Distributions over Data

Alisa Kovtunova, Rafael Peñaloza

Recent work has studied a probabilistic extension of the temporal logic LTL that refines the eventuality (or diamond) constructor with a probability distribution on when will this…

cs.LO2018

Query Answering for Rough EL Ontologies (Extended Technical Report)

Rafael Peñaloza, Veronika Thost, Anni-Yasmin Turhan

Querying large datasets with incomplete and vague data is still a challenge. Ontology-based query answering extends standard database query answering by background knowledge from a…

cs.LO2018

Repairing Description Logic Ontologies by Weakening Axioms

Franz Baader, Francesco Kriegel, Adrian Nuradiansyah +1

The classical approach for repairing a Description Logic ontology O in the sense of removing an unwanted consequence is to delete a minimal number of axioms from O such that th…

cs.LO2018★ 2 cited

Consequence-Based Axiom Pinpointing

Ana Ozaki, Rafael Peñaloza

Axiom pinpointing refers to the problem of finding the axioms in an ontology that are relevant for understanding a given entailment or consequence. One approach for axiom pinpointi…

cs.LO2015

Answering Fuzzy Conjunctive Queries over Finitely Valued Fuzzy Ontologies

Stefan Borgwardt, Theofilos Mailis, Rafael Peñaloza +1

Fuzzy Description Logics (DLs) provide a means for representing vague knowledge about an application domain. In this paper, we study fuzzy extensions of conjunctive queries (CQs) o…