@inproceedings{https___doi.org_10.4230_lipics.csl.2025.8,
    doi = {10.4230/lipics.csl.2025.8},
    url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2025.8},
    author = {van Bergerem, Steffen and Grohe, Martin and Runde, Nina},
    keywords = {monadic second-order definable concept learning, agnostic probably approximately correct learning, parameterized complexity, clique-width, fixed-parameter tractable, Boolean classification, supervised learning, monadic second-order logic, Theory of computation → Logic, Theory of computation → Complexity theory and logic, Theory of computation → Fixed parameter tractability, Computing methodologies → Logical and relational learning, Computing methodologies → Supervised learning},
    language = {en},
    title = {The Parameterized Complexity of Learning Monadic Second-Order Logic},
    publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik},
    year = {2025},
    copyright = {Creative Commons Attribution 4.0 International license},
    date-added = {2025-2-14 8:40:16 +0100}
}

@inproceedings{https___doi.org_10.4230_lipics.csl.2025.8, doi = {10.4230/lipics.csl.2025.8}, url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2025.8}, author = {van Bergerem, Steffen and Grohe, Martin and Runde, Nina}, keywords = {monadic second-order definable concept learning, agnostic probably approximately correct learning, parameterized complexity, clique-width, fixed-parameter tractable, Boolean classification, supervised learning, monadic second-order logic, Theory of computation → Logic, Theory of computation → Complexity theory and logic, Theory of computation → Fixed parameter tractability, Computing methodologies → Logical and relational learning, Computing methodologies → Supervised learning}, language = {en}, title = {The Parameterized Complexity of Learning Monadic Second-Order Logic}, publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, year = {2025}, copyright = {Creative Commons Attribution 4.0 International license}, date-added = {2025-2-14 8:40:16 +0100} }

Library Size: 13G (12941 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A badge