atlas

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

Checking Chase Termination over Ontologies of Existential Rules with Equality

AAAI 2020 · Learning theory and algorithms › Combinatorial and search optimization · approach: Logic and answer set programming theory · 2 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
Use renaming to handle equality instead of computing the chase over a singularisationChase computation · DBPediachase runtime: 590s -> 27.5sHelped
Use renaming to handle equality instead of computing the chase over a singularisationChase computation · Claroschase runtime: 67.4s -> 11.7sHelped
Apply EMFA directly instead of MFA with the standard equality axiomatisationAcyclicity checking · MOWLCorprule sets classified as acyclic: 73 -> 387Helped
Apply EMFA directly instead of MFA with singularisationAcyclicity checking · MOWLCorpaverage check runtime relative to MFA plus singularisation: 35%Helped
Apply EMFA directly instead of MFA with singularisationAcyclicity checking · Oxford Ontology Repositoryaverage check runtime relative to MFA plus singularisation: 60%Helped
Apply EMFA directly rather than MFA with singularisationAcyclicity checking · Oxford Ontology Repositoryrule sets classified as acyclic: 38 vs 38No clear effect

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