A logical preprocessing step using answer set programming removes impossible rules from the ILP hypothesis space, reducing learning times from hours to seconds while preserving accuracy in visual reasoning and game domains.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Generalizes PDL to OPDL by distinguishing programs from traces via arbitrary operational semantics and proves cut-elimination for a non-wellfounded sequent calculus.
citing papers explorer
-
Honey, I shrunk the hypothesis space (through logical preprocessing)
A logical preprocessing step using answer set programming removes impossible rules from the ILP hypothesis space, reducing learning times from hours to seconds while preserving accuracy in visual reasoning and game domains.
-
On Propositional Dynamic Logic and Concurrency
Generalizes PDL to OPDL by distinguishing programs from traces via arbitrary operational semantics and proves cut-elimination for a non-wellfounded sequent calculus.