The recommended description of an entrustable professional activity: AMEE Guide No. 140
Entrustable professional activities (EPAs) have received much attention in the literature
since they were first proposed in 2005. Useful guidelines, workshops, courses, and …
since they were first proposed in 2005. Useful guidelines, workshops, courses, and …
First order-rewritability and containment of conjunctive queries in Horn description logics
We study FO-rewritability of conjunctive queries in the presence of ontologies formulated in
a description logic between EL and Horn-SHIF, along with related query containment …
a description logic between EL and Horn-SHIF, along with related query containment …
Flag & check: Data access with monadically defined queries
We introduce monadically defined queries (MODEQs) and nested monadically defined
queries (NEMODEQs), two querying formalisms that extend conjunctive queries, conjunctive …
queries (NEMODEQs), two querying formalisms that extend conjunctive queries, conjunctive …
The complexity of boundedness for guarded logics
Given a formula phi (x, X) positive in X, the bounded ness problem asks whether the fix point
induced by phi is reached within some uniform bound independent of the structure (ie …
induced by phi is reached within some uniform bound independent of the structure (ie …
Unary negation
L Segoufin, B ten Cate - Logical Methods in Computer …, 2013 - lmcs.episciences.org
We study fragments of first-order logic and of least fixed point logic that allow only unary
negation: negation of formulas with at most one free variable. These logics generalize many …
negation: negation of formulas with at most one free variable. These logics generalize many …
Reasonable highly expressive query languages
Expressive query languages are gaining relevance in knowledge representation (KR), and
new reasoning problems come to the fore. Especially query containment is interesting in this …
new reasoning problems come to the fore. Especially query containment is interesting in this …
[PDF][PDF] The impact of disjunction on query answering under guarded-based existential rules
Edinburgh Research Explorer Page 1 Edinburgh Research Explorer The Impact of Disjunction on
Query Answering Under GuardedBased Existential Rules Citation for published version: Bourhis …
Query Answering Under GuardedBased Existential Rules Citation for published version: Bourhis …
[PDF][PDF] Containment in monadic disjunctive datalog, MMSNP, and expressive description logics
We study query containment in three closely related formalisms: monadic disjunctive
Datalog (MDDLog), MMSNP (a logical generalization of constraint satisfaction problems) …
Datalog (MDDLog), MMSNP (a logical generalization of constraint satisfaction problems) …
Unary negation
B Ten Cate, L Segoufin - 28th International Symposium on …, 2011 - drops.dagstuhl.de
We study fragments of first-order logic and of least fixed point logic that allow only unary
negation: negation of formulas with at most one free variable. These logics generalize many …
negation: negation of formulas with at most one free variable. These logics generalize many …
How Can Reasoners Simplify Database Querying (And Why Haven't They Done It Yet)?
M Benedikt - Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI …, 2018 - dl.acm.org
The last few decades have seen vast progress in computational reasoning. This has
included significant developments in theory, increasing maturity of tools both in performance …
included significant developments in theory, increasing maturity of tools both in performance …