atlas

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

The Expressive Power of Ad-Hoc Constraints for Modelling CSPs

AAAI 2023 · Learning theory and algorithms › Combinatorial and search optimization · approach: Structure and complexity of constraint reasoning · 3 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 BCT instead of OMVD to encode fixed-treewidth CSPsAd-hoc constraint representation · F14: CSPs with fixed treewidthpolysize encodabilityHelped
Use CFG instead of BCT to encode F15Ad-hoc constraint representation · F15: mirrored-string constraint familypolysize encodabilityHelped
Use BCT instead of smaT for conjunctionAd-hoc constraint operations · Conjunction of constraintstractabilityHelped
Use BCT instead of smaT for forgetting variablesAd-hoc constraint operations · Forgetting (FO)tractabilityHelped
Use sMDD instead of OMDD for sentential entailmentAd-hoc constraint queries · Sentential entailmenttractabilityHurt
Use table instead of shoT for validity queriesAd-hoc constraint queries · ValiditytractabilityHelped

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