The Logical Difference Problem for Description Logic Terminologies
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Data Privacy for $\mathcal{ALC}$ Knowledge Bases
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Mathematical Logic for Life Science Ontologies
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Reasoning and explanation in EL and in expressive description logics
ReasoningWeb'10 Proceedings of the 6th international conference on Semantic technologies for software engineering
Generalized satisfiability for the description logic ALC
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
The logical difference for the lightweight description logic EL
Journal of Artificial Intelligence Research
A goal-oriented algorithm for unification in ELHR+ w.r.t. cycle-restricted ontologies
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Generalized satisfiability for the description logic ALC
Theoretical Computer Science
Hi-index | 0.00 |
The theme of this paper is profunctors, and their centrality and ubiquity in understanding concurrent computation. Profunctors (a.k.a. distributors, or bimodules) are a generalisation of relations to categories. Here they are first presented and motivated ...