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

24 papers

cs.SE2023★ 2 cited

On the Empirical Evidence of Microservice Logical Coupling. A Registered Report

Dario Amoroso d Aragona, Luca Pascarella, Andrea Janes +3

[Context] Coupling is a widely discussed metric by software engineers while developing complex software systems, often referred to as a crucial factor and symptom of a poor or good…

cs.SE2023

Breaks and Code Quality: Investigating the Impact of Forgetting on Software Development. A Registered Report

Dario Amoroso d'Aragona, Luca Pascarella, Andrea Janes +3

Developers interrupting their participation in a project might slowly forget critical information about the code, such as its intended purpose, structure, the impact of external de…

cs.AI2021

Answering Fuzzy Queries over Fuzzy DL-Lite Ontologies

Gabriella Pasi, Rafael Peñaloza

A prominent problem in knowledge representation is how to answer queries taking into account also the implicit consequences of an ontology representing domain knowledge. While this…

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.DB2021

Probabilistic Trace Alignment

Giacomo Bergami, Fabrizio Maria Maggi, Marco Montali +1

Alignments provide sophisticated diagnostics that pinpoint deviations in a trace with respect to a process model and their severity. However, approaches based on trace alignments u…

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.DB2019★ 1 cited

Enriching Ontology-based Data Access with Provenance (Extended Version)

Diego Calvanese, Davide Lanti, Ana Ozaki +2

Ontology-based data access (OBDA) is a popular paradigm for querying heterogeneous data sources by connecting them through mappings to an ontology. In OBDA, it is often difficult t…

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.AI2017

Repairing Ontologies via Axiom Weakening

Nicolas Troquard, Roberto Confalonieri, Pietro Galliani +3

Ontology engineering is a hard and error-prone task, in which small changes may lead to errors, or even produce an inconsistent ontology. As ontologies grow in size, the need for a…

cs.AI2017

A Decidable Very Expressive Description Logic for Databases (Extended Version)

Alessandro Artale, Enrico Franconi, Rafael Peñaloza +1

We introduce , an extension of the n-ary propositionally closed description logic to deal with attribute-labelled tuples (generalising the position…

cs.AI2017★ 1 cited

Towards Statistical Reasoning in Description Logics over Finite Domains (Full Version)

Rafael Peñaloza, Nico Potyka

We present a probabilistic extension of the description logic for reasoning about statistical knowledge. We consider conditional statements over proportions of the…

cs.AI2016★ 1 cited

Probabilistic Reasoning in the Description Logic ALCP with the Principle of Maximum Entropy (Full Version)

Rafael Peñaloza, Nico Potyka

A central question for knowledge representation is how to encode and handle uncertain knowledge adequately. We introduce the probabilistic description logic ALCP that is designed f…

cs.AI2015

Reasoning in Infinitely Valued G-IALCQ

Stefan Borgwardt, Rafael Peñaloza

Fuzzy Description Logics (FDLs) are logic-based formalisms used to represent and reason with vague or imprecise knowledge. It has been recently shown that reasoning in most FDLs us…

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…

cs.AI2015★ 6 cited

Fuzzy Answer Set Computation via Satisfiability Modulo Theories

Mario Alviano, Rafael Penaloza

Fuzzy answer set programming (FASP) combines two declarative frameworks, answer set programming and fuzzy logic, in order to model reasoning by default over imprecise information.…

cs.AI2015★ 1 cited

Dynamic Bayesian Ontology Languages

İsmail İlkan Ceylan, Rafael Peñaloza

Many formalisms combining ontology languages with uncertainty, usually in the form of probabilities, have been studied over the years. Most of these formalisms, however, assume tha…