atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Beyond OWL 2 QL in OBDA: Rewritings and Approximations

AAAI 2016 · Learning theory and algorithms › Combinatorial and search optimization · approach: Logic and answer set programming theory · 15 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
compile ontology semantics into mappings (ONTOPROX) instead of ignoring non-DL-Lite axiomsONTOP · UOBM Qu4number of answers: 19 -> 38Helped
use ONTOPROX instead of LSA/GSA approximationTelecom queries · Telecom Qt1number of answers: 0 -> 82,455Helped
use ONTOPROX instead of LSA/GSA approximationTelecom queries · Telecom Qt2number of answers: 0 -> 16,487Helped
use ONTOPROX instead of LSA/GSAUOBM · UOBM Qu3number of answers: 235 -> 247Helped
use ONTOPROX instead of LSA/GSAUOBM · UOBM Qu1number of answers: 14,197 -> 14,197No clear effect
use ONTOPROX instead of default ONTOPTelecom Qt3 · Telecom Qt3query time (s): 128 -> 437Hurt
use ONTOPROX instead of CLIPPER over materialized ABoxUOBM · UOBM Qu4query time (s): 21.4 -> 0.52Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy