Rafael Peñaloza
40 publications
11 venues
H Index 13
Affiliation
University of Milano-Bicocca, ItalyFree University of Bozen-Bolzano, Italy
Dresden University of Technology, Germany
Links
DBLPGoogle Scholar
ORCID- https://rpenalozan.github.io/
- https://zbmath.org/authors/?q=ai:penaloza.rafael
- https://mathscinet.ams.org/mathscinet/MRAuthorID/835881
- https://mathgenealogy.org/id.php?id=151387
- https://www.wikidata.org/entity/Q57517599
- https://d-nb.info/gnd/139758488
- https://dblp.uni-trier.de/pers/hd/n/Nyssen:Rafael_Peñaloza
| Name | Venue | Year | citations |
|---|---|---|---|
Enumerating Minimal Unsatisfiable Cores of LTLf Formulae.
|
AAAI | 2026 | 0 |
| Possibilistic Reasoning on Finite-Time Linear Temporal Logic.
|
ECAI | 2025 | 0 |
| Union and Intersection of All Justifications.
|
ESWC | 2022 | 0 |
| Towards a Logic of Meta-Analysis.
|
KR | 2020 | 4 |
| Reasoning with Contextual Knowledge and Influence Diagrams.
|
KR | 2020 | 1 |
| Provenance for the Description Logic ELHr.
|
IJCAI | 2020 | 28 |
| Temporal Logics Over Finite Traces with Uncertainty.
|
AAAI | 2020 | 0 |
| Computing Compliant Anonymisations of Quantified ABoxes w.r.t.
|
ISWC | 2020 | 0 |
| A Bayesian Extension of the Description Logic
|
JELIA | 2019 | 0 |
| Enriching Ontology-based Data Access with Provenance.
|
IJCAI | 2019 | 0 |
| Cutting Diamonds: A Temporal Logic with Probabilistic Distributions.
|
KR | 2018 | 10 |
| Query Answering for Rough EL Ontologies.
|
KR | 2018 | 6 |
| Two Approaches to Ontology Aggregation Based on Axiom Weakening.
|
IJCAI | 2018 | 18 |
| Repairing Ontologies via Axiom Weakening.
|
AAAI | 2018 | 0 |
| Making Repairs in Description Logics More Gentle.
|
KR | 2018 | 0 |
| Lean Kernels in Description Logics.
|
ESWC | 2017 | 16 |
| Semantic Rules for Machine Diagnostics: Execution and Management.
|
CIKM | 2017 | 13 |
| Minimal Undefinedness for Fuzzy Answer Sets.
|
AAAI | 2017 | 10 |
| Understanding the complexity of axiom pinpointing in lightweight description logics.
|
Artificial Intelligence | 2017 | 45 |
| Query Answering in Ontologies under Preference Rankings.
|
IJCAI | 2017 | 3 |
| A Decidable Very Expressive Description Logic for Databases.
|
ISWC | 2017 | 7 |
| Efficient Reasoning for Inconsistent Horn Formulae.
|
JELIA | 2016 | 13 |
| BEACON: An Efficient SAT-Based Tool for Debugging
|
SAT | 2016 | 0 |
| Complexity Results for Probabilistic Datalog
|
ECAI | 2016 | 0 |
| The Complexity of Subsumption in Fuzzy EL.
|
IJCAI | 2015 | 13 |
| The limits of decidability in fuzzy description logics with general concept inclusions.
|
Artificial Intelligence | 2015 | 67 |
| Answering Instance Queries Relaxed by Concept Similarity.
|
KR | 2014 | 12 |
| The Fuzzy Description Logic $\mathsf{G}\text{-}{\mathcal{F\!L}_0} $ with Greatest Fixed-Point Semantics.
|
JELIA | 2014 | 3 |
| Tight Complexity Bounds for Reasoning in the Description Logic $\mathcal{BE{\kern-.1em}L}$.
|
JELIA | 2014 | 7 |
| Decidable Gödel Description Logics without the Finitely-Valued Model Property.
|
KR | 2014 | 33 |
| Error-Tolerant Reasoning in the Description Logic $\mathcal{E{\kern-.1em}L}$.
|
JELIA | 2014 | 23 |
| Positive Subsumption in Fuzzy EL with General t-Norms.
|
IJCAI | 2013 | 0 |
| Undecidability of Fuzzy Description Logics.
|
KR | 2012 | 70 |
| Description Logics over Lattices with Multi-Valued Ontologies.
|
IJCAI | 2011 | 37 |
| A Practical Approach for Computing Generalization Inferences in
|
ESWC | 2011 | 0 |
| On the Complexity of Axiom Pinpointing in the EL Family of Description Logics.
|
KR | 2010 | 49 |
| A Generic Approach for Correcting Access Restrictions to a Consequence.
|
ESWC | 2010 | 15 |
| Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics.
|
ECAI | 2010 | 0 |
| A Generic Approach for Large-Scale Ontological Reasoning in the Presence of Access Restrictions to the Ontology's Axioms.
|
ISWC | 2009 | 45 |
| Axiom Pinpointing in General Tableaux.
|
TABLEAUX | 2007 | 171 |