The following pages link to Rafael Peñaloza (Q465591):
Displaying 47 items.
- Consistency reasoning in lattice-based fuzzy description logics (Q465592) (← links)
- Completion-based generalization inferences for the description logic \(\mathcal{ELOR}\) with subjective probabilities (Q465595) (← links)
- Algorithms for reasoning in very expressive description logics under infinitely valued Gödel semantics (Q518606) (← links)
- Automata-based axiom pinpointing (Q707741) (← links)
- Similarity-based relaxed instance queries (Q901081) (← links)
- Automata can show PSpace results for description logics (Q948069) (← links)
- Upward refinement operators for conceptual blending in the description logic \(\mathcal{EL}^{++}\) (Q1653445) (← links)
- Reasoning in fuzzy description logics using automata (Q1677933) (← links)
- The complexity of fuzzy \(\mathcal{EL}\) under the Łukasiewicz t-norm (Q1679661) (← links)
- Understanding the complexity of axiom pinpointing in lightweight description logics (Q1680678) (← links)
- Query answering in fuzzy DL-Lite with graded axioms (Q1995446) (← links)
- Repairing socially aggregated ontologies using axiom weakening (Q2092516) (← links)
- Explaining axiom pinpointing (Q2185485) (← links)
- A Bayesian extension of the description logic \(\mathcal{ALC}\) (Q2296717) (← links)
- On the decidability status of fuzzy \(\mathcal {A}\mathcal {L}\mathcal {C}\) with general concept inclusions (Q2341257) (← links)
- The Bayesian ontology language \(\mathcal {BEL}\) (Q2362495) (← links)
- The complexity of computing the behaviour of lattice automata on infinite trees (Q2447756) (← links)
- The limits of decidability in fuzzy description logics with general concept inclusions (Q2512986) (← links)
- Pinpointing axioms in ontologies via ASP (Q2694580) (← links)
- BEACON: An Efficient SAT-Based Tool for Debugging $${\mathcal {EL}}{^+}$$ Ontologies (Q2818038) (← links)
- Efficient Reasoning for Inconsistent Horn Formulae (Q2835881) (← links)
- Roughening the $\mathcal{EL}$ Envelope (Q2849483) (← links)
- How Fuzzy Is My Fuzzy Description Logic? (Q2908480) (← links)
- The Fuzzy Description Logic $\mathsf{G}\text{-}{\mathcal{F\!L}_0} $ with Greatest Fixed-Point Semantics (Q2938484) (← links)
- Tight Complexity Bounds for Reasoning in the Description Logic $\mathcal{BE{\kern-.1em}L}$ (Q2938485) (← links)
- Error-Tolerant Reasoning in the Description Logic $\mathcal{E{\kern-.1em}L}$ (Q2938488) (← links)
- Reasoning in Expressive Description Logics under Infinitely Valued Gödel Semantics (Q2964452) (← links)
- Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics (Q2999101) (← links)
- On the Undecidability of Fuzzy Description Logics with GCIs and Product T-norm (Q3172882) (← links)
- The Bayesian Description Logic ${\mathcal{BEL}}$ (Q3192213) (← links)
- Axiom Pinpointing in General Tableaux (Q3406682) (← links)
- Automata-Based Axiom Pinpointing (Q3541704) (← links)
- Using Sums-of-Products for Non-standard Reasoning (Q3564888) (← links)
- Complexity Results for Probabilistic Datalog (Q4576254) (← links)
- Fuzzy answer set computation via satisfiability modulo theories (Q4592999) (← links)
- (Q4627753) (← links)
- Fuzzy Description Logics – A Survey (Q5045302) (← links)
- Towards Statistical Reasoning in Description Logics over Finite Domains (Q5045314) (← links)
- Inconsistency-Tolerant Instance Checking in Tractable Description Logics (Q5086209) (← links)
- Probabilistic Reasoning in the Description Logic $$\mathcal {ALCP}$$ with the Principle of Maximum Entropy (Q5268422) (← links)
- Fuzzy answer sets approximations (Q5398309) (← links)
- Axiom Pinpointing in General Tableaux (Q5434476) (← links)
- Instance-Based Non-standard Inferences in $\mathcal{EL}$ with Subjective Probabilities (Q5507386) (← links)
- An Automata View to Goal-Directed Methods (Q5738990) (← links)
- (Q5740415) (← links)
- The Probabilistic Description Logic (Q6063856) (← links)
- Introduction to Probabilistic Ontologies (Q6488095) (← links)
