Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Rafael Peñaloza
Rafael Peñaloza Nyssen
2010 – today
- 2013
[j5]Stefan Borgwardt, Rafael Peñaloza: The Complexity of Lattice-Based Fuzzy Description Logics. J. Data Semantics 2(1): 1-19 (2013)- [c44]
- [c43]
- [c42]Andreas Ecke, Rafael Peñaloza, Anni-Yasmin Turhan: Role-depth Bounded Least Common Subsumer in Prob-EL with Nominals. Description Logics 2013: 670-688
- [c41]
- [c40]Stefan Borgwardt, Rafael Peñaloza: Positive Subsumption in Fuzzy EL with General t-Norms. IJCAI 2013
- [c39]Andreas Ecke, Rafael Peñaloza, Anni-Yasmin Turhan: Computing Role-Depth Bounded Generalizations in the Description Logic. KI 2013: 49-60
- [c38]Rafael Peñaloza, Anni-Yasmin Turhan: Instance-Based Non-standard Inferences in $\mathcal{EL}$ with Subjective Probabilities. URSW (LNCS Vol.) 2013: 80-98
- 2012
- [j4]Franz Baader, Martin Knechtel, Rafael Peñaloza: Context-dependent views to axioms and consequences of Semantic Web ontologies. J. Web Sem. 12: 22-40 (2012)
- [c37]Stefan Borgwardt, Felix Distel, Rafael Peñaloza: How Fuzzy Is My Fuzzy Description Logic? IJCAR 2012: 82-96
- [c36]Stefan Borgwardt, Felix Distel, Rafael Peñaloza: Gödel Negation Makes Unwitnessed Consistency Crisp. Description Logics 2012
- [c35]Stefan Borgwardt, Rafael Peñaloza: Non-Gödel Negation Makes Unwitnessed Consistency Undecidable. Description Logics 2012
- [c34]
- [c33]
- [c32]Stefan Borgwardt, Rafael Peñaloza: A Tableau Algorithm for Fuzzy Description Logics over Residuated De Morgan Lattices. RR 2012: 9-24
- 2011
- [c31]Stefan Borgwardt, Rafael Peñaloza: The Inclusion Problem for Weighted Automata on Infinite Trees. AFL 2011: 108-122
- [c30]Franz Baader, Rafael Peñaloza: GCIs Make Reasoning in Fuzzy DL with the Product T-norm Undecidable. Description Logics 2011
- [c29]Stefan Borgwardt, Rafael Peñaloza: Fuzzy Ontologies over Lattices with T-norms. Description Logics 2011
- [c28]Eldora, Martin Knechtel, Rafael Peñaloza: Correcting Access Restrictions to a Consequence More Flexibly. Description Logics 2011
- [c27]Rafael Peñaloza, Anni-Yasmin Turhan: A Practical Approach for Computing Generalization Inferences in EL\mathcal{EL}. ESWC (1) 2011: 410-423
- [c26]Franz Baader, Rafael Peñaloza: On the Undecidability of Fuzzy Description Logics with GCIs and Product T-norm. FroCoS 2011: 55-70
- [c25]Franz Baader, Rafael Peñaloza: Are fuzzy description logics with general concept inclusion axioms decidable? FUZZ-IEEE 2011: 1735-1742
- [c24]Stefan Borgwardt, Rafael Peñaloza: Description Logics over Lattices with Multi-Valued Ontologies. IJCAI 2011: 768-773
- [c23]Stefan Borgwardt, Rafael Peñaloza: Finite Lattices Do Not Make Reasoning in ALCI Harder. URSW 2011: 51-62
- 2010
- [j3]Franz Baader, Rafael Peñaloza: Automata-Based Axiom Pinpointing. J. Autom. Reasoning 45(2): 91-129 (2010)
- [j2]Franz Baader, Rafael Peñaloza: Axiom Pinpointing in General Tableaux. J. Log. Comput. 20(1): 5-34 (2010)
- [c22]Rafael Peñaloza, Anni-Yasmin Turhan: Towards Approximative Most Specific Concepts by Completion for EL with Subjective Probabilities. UniDL 2010
- [c21]Martin Knechtel, Rafael Peñaloza: Correcting Access Restrictions to a Consequence. Description Logics 2010
- [c20]Rafael Peñaloza, Baris Sertkaya: Complexity of Axiom Pinpointing in the DL-Lite Family. Description Logics 2010
- [c19]Anni-Yasmin Turhan, Rafael Peñaloza: Role-depth Bounded Least Common Subsumers by Completion for EL- and prob-EL-TBoxes. Description Logics 2010
- [c18]Rafael Peñaloza, Baris Sertkaya: Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics. ECAI 2010: 29-34
- [c17]Martin Knechtel, Rafael Peñaloza: A Generic Approach for Correcting Access Restrictions to a Consequence. ESWC (1) 2010: 167-182
- [c16]Rafael Peñaloza, Baris Sertkaya: On the Complexity of Axiom Pinpointing in the EL Family of Description Logics. KR 2010
- [c15]
- [e1]Thomas Lukasiewicz, Rafael Peñaloza, Anni-Yasmin Turhan (Eds.): Proceedings of the First International Workshop on Uncertainty in Description Logics, Edinburgh, UK, July 20, 2010. CEUR Workshop Proceedings 613, CEUR-WS.org 2010
2000 – 2009
- 2009
- [b1]Rafael Peñaloza Nyssen: Axiom pinpointing in description logics and beyond. Dresden University of Technology 2009, pp. 1-144
- [c14]
- [c13]
- [c12]Rafael Peñaloza: Wie findet man die verantwortlichen Axiome? Axiom-Pinpointing in Beschreibungslogiken. Ausgezeichnete Informatikdissertationen 2009: 181-190
- [c11]Franz Baader, Martin Knechtel, Rafael Peñaloza: A Generic Approach for Large-Scale Ontological Reasoning in the Presence of Access Restrictions to the Ontology's Axioms. International Semantic Web Conference 2009: 49-64
- 2008
- [j1]Franz Baader, Jan Hladik, Rafael Peñaloza: Automata can show PSpace results for description logics. Inf. Comput. 206(9-10): 1045-1056 (2008)
- [c10]
- [c9]
- 2007
- [c8]Franz Baader, Jan Hladik, Rafael Peñaloza: Blocking Automata for PSPACE DLs. Description Logics 2007
- [c7]Franz Baader, Rafael Peñaloza, Boontawee Suntisrivaraporn: Pinpointing in the Description Logic EL. Description Logics 2007
- [c6]Franz Baader, Rafael Peñaloza, Boontawee Suntisrivaraporn: Pinpointing in the Description Logic EL+. KI 2007: 52-67
- [c5]Franz Baader, Jan Hladik, Rafael Peñaloza: SI! Automata Can Show PSPACE Results for Description Logics. LATA 2007: 67-78
- [c4]
- 2006
- [c3]
- [c2]Alexander Kozlenkov, Rafael Peñaloza, Vivek Nigam, Loïc Royer, Gihan Dawelbait, Michael Schroeder: Prova: Rule-Based Java Scripting for Distributed Web Applications: A Case Study in Bioinformatics. EDBT Workshops 2006: 899-908
- 2003
- [c1]Osvaldo Cairó, Rafael Peñaloza: Using Bayesian Networks as an Inference Engine in KAMET. SCCC 2003: 79-85
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:11 CEST by the dblp team