Formal Languages

Eesthetic: A Paralex Lexicon of Estonian Paradigms COLING 2024 Knowledge Compilation for Incremental and Checkable Stochastic Boolean Satisfiability IJCAI 2024 Learning Broadcast Protocols AAAI 2024 Linear-Time Verification of Data-Aware Processes Modulo Theories via Covers and Automata AAAI 2024 Minimal Macro-Based Rewritings of Formal Languages: Theory and Applications in Ontology Engineering (and Beyond) AAAI 2024 Primal Grammars Driven Automated Induction IJCAI 2024 PyFoma: a Python finite-state compiler module ACL 2024 Selene: Pioneering Automated Proof in Software Verification ACL 2024 Solving Quantified Boolean Formulas with Few Existential Variables IJCAI 2024 Submodel Enumeration for CTL Is Hard AAAI 2024 The Expressive Capacity of State Space Models: A Formal Language Perspective NeurIPS 2024 Using Symmetries to Lift Satisfiability Checking AAAI 2024 Automata Cascades: Expressivity and Sample Complexity AAAI 2023 Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth? AAAI 2023 Co-Certificate Learning with SAT Modulo Symmetries IJCAI 2023 Convergence and Diversity in the Control Hierarchy ACL 2023 Lifting (D)QBF Preprocessing and Solving Techniques to (D)SSAT AAAI 2023 Moral Planning Agents with LTL Values IJCAI 2023 The Surprising Computational Power of Nondeterministic Stack RNNs ICLR 2023 Transformers Learn Shortcuts to Automata ICLR 2023 Working Towards Digital Documentation of Uralic Languages With Open-Source Tools and Modern NLP Methods EMNLP 2023 Characterizing the Program Expressive Power of Existential Rule Languages AAAI 2022 DuoAI: Fast, Automated Inference of Inductive Invariants for Verifying Distributed Protocols OSDI 2022 Logical Transductions for the Typology of Ditransitive Prosody NAACL 2022 Simulating Feature Structures with Simple Types NAACL 2022