atlas

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

Domain-Lifted Sampling for Universal Two-Variable Logic and Extensions

AAAI 2022 · Learning theory and algorithms › Combinatorial and search optimization · approach: Logic and answer set programming theory · 6 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 domain-lifted first-order sampling rather than propositional samplingFriends-smokers MLN · Friends-smokers MLNmaximum domain size tested: 30 to 100Helped
Add a single tree constraint to UFO2UFO2 sampling · UFO2 with a single tree constraintdomain-liftabilityHelped
Add cardinality constraints and a single tree constraint to UFO2UFO2 sampling · UFO2 with a single tree constraint and multiple cardinality constraintsdomain-liftabilityHelped

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