AI Paper Atlas

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

Deciding the Loosely Guarded Fragment and Querying Its Horn Fragment Using Resolution

Sen Zheng, Renate Schmidt

AAAI 2020 · Learning theory and algorithms › Combinatorial and search optimization · approach: SAT and model counting solvers · 2 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 top-variable selection to resolve clauses containing potentially deepest terms firstLGF-Res and Query-Res · Loosely guarded fragment and Horn LGF query answeringvariable-depth growthImproved
Apply LGC-Res with LGC-Refine to loosely guarded clausesLGF-Res · LGF satisfiabilitytermination and decision procedureImproved
Extend the resolution procedure to query clauses and Horn LGCsQuery-Res · Boolean conjunctive query answering over Horn LGFtermination and decision procedureImproved
Restrict queries to loosely guarded, star, or cloud queriesQuery-Res · Query answering over LGFtermination and decision procedureImproved
Use the procedure for arbitrary BCQs over LGF, including cases where the top variable is isolatedQuery-Res · Boolean conjunctive query answering over LGFclosure of resolvents under the procedureHurt

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