atlas

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

Representing and Learning Grammars in Answer Set Programming

AAAI 2019 · Learning theory and algorithms › Combinatorial and search optimization · approach: Logic and answer set programming theory · 22 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
start from a narrower initial language (CFG a^n b^n c^m instead of a^i b^j c^k) (ablation)ASG learner · a^n b^n c^ntotal learning time: 5.1s -> 1.3sHelped
include existing annotations (i=j) in the initial grammar (ablation)ASG learner · a^n b^n c^ntotal learning time: 5.1s -> 1.4sHelped
widen the initial language to (a|b|c)* so the CFG is effectively learned (ablation)ASG learner · a^n b^n c^ntotal learning time: 5.1s -> 13314.9sHurt
restrict to Horn clauses with duplicate production rules given as background (ablation)ASG learner · graph-col (3-colourability)total learning time: 256.9s -> 23.8sHelped
ASG learner vs LIG learner that learns whole grammarASG learner · copy language and a^n b^n c^n Dlearning time: 1004s vs 18s on DMixed

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