atlas

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

Materialisation-Based Reasoning in DatalogMTL with Bounded Intervals

AAAI 2023 · 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 saturation detection and unfolding instead of continuing materialisation or switching to automata-based reasoningDatalogMTL reasoning on LUBM temporal extension · LUBM temporal extensionrunning timeHelped
Use saturation detection and unfolding instead of continuing materialisation or switching to automata-based reasoningDatalogMTL reasoning on iTemporal · iTemporalrunning timeHelped
Add saturation checks during materialisationProposed approach · LUBM temporal extensionmaterialisation running timeNo clear effect
Increase dataset sizeProposed approach · LUBM temporal extensionrunning timeMixed
Increase the number of constants rather than the temporal rangeProposed approach · LUBM temporal extensionrunning time: around twice smallerHurt
Increase dataset sizeProposed approach · iTemporalrunning timeHurt

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