IdMAT and LIndA enable learning any regular language consistent with an incomplete inductive teacher by reducing uncertainties to incremental SAT solving for tasks like language separation and invariant synthesis.
(eds.): Proceedings of SAT Competition 2023: Solver, Benchmark and Proof Checker Descriptions
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Automata Learning with an Incomplete but Inductive Teacher (Technical Report)
IdMAT and LIndA enable learning any regular language consistent with an incomplete inductive teacher by reducing uncertainties to incremental SAT solving for tasks like language separation and invariant synthesis.