Union and Intersection of All Justifications.
|
ESWC |
2022 |
0 |
Computing Compliant Anonymisations of Quantified ABoxes w.r.t.
|
ISWC |
2020 |
0 |
Temporal Logics Over Finite Traces with Uncertainty.
|
AAAI |
2020 |
0 |
Provenance for the Description Logic ELHr.
|
IJCAI |
2020 |
0 |
Towards a Logic of Meta-Analysis.
|
KR |
2020 |
0 |
Reasoning with Contextual Knowledge and Influence Diagrams.
|
KR |
2020 |
0 |
Enriching Ontology-based Data Access with Provenance.
|
IJCAI |
2019 |
0 |
A Bayesian Extension of the Description Logic
|
JELIA |
2019 |
0 |
Making Repairs in Description Logics More Gentle.
|
KR |
2018 |
2 |
Cutting Diamonds: A Temporal Logic with Probabilistic Distributions.
|
KR |
2018 |
4 |
Query Answering for Rough EL Ontologies.
|
KR |
2018 |
0 |
Two Approaches to Ontology Aggregation Based on Axiom Weakening.
|
IJCAI |
2018 |
2 |
Repairing Ontologies via Axiom Weakening.
|
AAAI |
2018 |
0 |
Query Answering in Ontologies under Preference Rankings.
|
IJCAI |
2017 |
1 |
Lean Kernels in Description Logics.
|
ESWC |
2017 |
3 |
Understanding the complexity of axiom pinpointing in lightweight description logics.
|
Artificial Intelligence |
2017 |
10 |
Minimal Undefinedness for Fuzzy Answer Sets.
|
AAAI |
2017 |
7 |
Semantic Rules for Machine Diagnostics: Execution and Management.
|
CIKM |
2017 |
7 |
A Decidable Very Expressive Description Logic for Databases.
|
ISWC |
2017 |
0 |
Efficient Reasoning for Inconsistent Horn Formulae.
|
JELIA |
2016 |
7 |
Complexity Results for Probabilistic Datalog
|
ECAI |
2016 |
0 |
BEACON: An Efficient SAT-Based Tool for Debugging
|
SAT |
2016 |
0 |
The Complexity of Subsumption in Fuzzy EL.
|
IJCAI |
2015 |
10 |
The limits of decidability in fuzzy description logics with general concept inclusions.
|
Artificial Intelligence |
2015 |
31 |
Tight Complexity Bounds for Reasoning in the Description Logic $\mathcal{BE{\kern-.1em}L}$.
|
JELIA |
2014 |
0 |
Decidable Gödel Description Logics without the Finitely-Valued Model Property.
|
KR |
2014 |
18 |
The Fuzzy Description Logic $\mathsf{G}\text{-}{\mathcal{F\!L}_0} $ with Greatest Fixed-Point Semantics.
|
JELIA |
2014 |
1 |
Answering Instance Queries Relaxed by Concept Similarity.
|
KR |
2014 |
7 |
Error-Tolerant Reasoning in the Description Logic $\mathcal{E{\kern-.1em}L}$.
|
JELIA |
2014 |
0 |
Positive Subsumption in Fuzzy EL with General t-Norms.
|
IJCAI |
2013 |
19 |
Undecidability of Fuzzy Description Logics.
|
KR |
2012 |
45 |
Description Logics over Lattices with Multi-Valued Ontologies.
|
IJCAI |
2011 |
29 |
A Practical Approach for Computing Generalization Inferences in
|
ESWC |
2011 |
0 |
A Generic Approach for Correcting Access Restrictions to a Consequence.
|
ESWC |
2010 |
9 |
On the Complexity of Axiom Pinpointing in the EL Family of Description Logics.
|
KR |
2010 |
33 |
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 |
26 |
Axiom Pinpointing in General Tableaux.
|
TABLEAUX |
2007 |
103 |