atlas

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

Externally Supported Models for Efficient Computation of Paracoherent Answer Sets

AAAI 2018 · Learning theory and algorithms › Combinatorial and search optimization · approach: Logic and answer set programming theory · 8 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
replace epistemic HT-transformation with extended externally supported transformationWEAK algorithm in WASP · ASP competition incoherent instancesinstances solved: 60 more instancesHelped
replace epistemic HT-transformation with extended externally supported transformationMINIM and SPLIT in WASP · ASP competition incoherent instancesinstances solved: 5 and 2 more instancesHelped
replace epistemic kappa-transformation with externally supported program PsMINIM, SPLIT, WEAK in WASP · ASP competition incoherent instancessolved instances / timeHelped
use Ps instead of P_kappaWASP · KnightTouravg atoms: 358 035 -> 141 054Helped
use Pes instead of P_HTWASP · MinDiagnavg rules: 2 549 729 -> 1 216 487Helped
use Ps/Pes instead of P_kappa/P_HTWASP · ASP competition incoherent instancesmemory usageHelped

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