cgFOC admits computable VC-dimension bounds on nowhere dense structures and efficient algorithms for query answering and PAC learning on locally bounded expansion classes, but a minor extension is intractable on trees.
Leigh (2017):Cut-free completeness for modal mu-calculus
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Bounded fitting can be extended to expressive description logics while retaining generalization guarantees and implemented practically via SAT solvers.
The paper establishes syntactic correspondences between non-wellfounded and cyclic proofs for LTL in linear nested sequents by proving completeness relative to saturation recurrence and introducing an unraveling shift procedure.
citing papers explorer
-
Complexity of Clique-Guarded First-Order Logic with Counting
cgFOC admits computable VC-dimension bounds on nowhere dense structures and efficient algorithms for query answering and PAC learning on locally bounded expansion classes, but a minor extension is intractable on trees.
-
Bounded Fitting for Expressive Description Logics
Bounded fitting can be extended to expressive description logics while retaining generalization guarantees and implemented practically via SAT solvers.
-
Non-Wellfounded and Cyclic Proofs for LTL: A Syntactic Correspondence with Linear Nested Sequents
The paper establishes syntactic correspondences between non-wellfounded and cyclic proofs for LTL in linear nested sequents by proving completeness relative to saturation recurrence and introducing an unraveling shift procedure.