atlas

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

Formula Synthesis in Propositional Dynamic Logic with Shuffle

AAAI 2022 · Learning theory and algorithms › Combinatorial and search optimization · approach: Logic and answer set programming theory · 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
Allow shuffle in the formula grammar without restricting the transition systemSYNTHPDL|| · General finite transition systemsdecidability / complexity: recursively-enumerable complete (and therefore undecidable)Hurt
Restrict candidate formulas to PDL, without shuffleSYNTHPDL|| · SYNTHPDLcomplexity: EXPTIME-completeHelped
Restrict the transition system to have finitely many pathsSYNTHPDL|| · Finitely-many-path transition systemscomplexity: in 2-EXPTIMEHelped
Restrict the PDL grammar to be linearSYNTHPDL · Linear PDL grammarscomplexity: PSPACE-completeHelped
Restrict the PDL grammar to be non-recursiveSYNTHPDL · Non-recursive PDL grammarscomplexity: in PSPACEHelped
Restrict the grammar to be non-recursive while allowing shuffleSYNTHPDL|| · Non-recursive grammarscomplexity: in EXPSPACEHelped
Restrict the PDL grammar to be both linear and non-recursiveSYNTHPDL · Linear, non-recursive PDL grammarscomplexity: NP-completeHelped

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