← Foundations
Computer Science › Foundations ›

Formal Languages

110 directly classified papers

Papers per year

Papers

Lifting Symmetry Breaking Constraints with Inductive Logic Programming IJCAI 2021
Recognizing Reduplicated Forms: Finite-State Buffered Machines ACL 2021
Neural Circuit Synthesis from Specification Patterns NIPS 2021
Parameterized Logical Theories AAAI 2021
Toward Determining NFA Equivalence via QBFs (Student Abstract) AAAI 2021
Deconstructing syntactic generalizations with minimalist grammars EMNLP 2021
Decidability and Complexity of Action-Based Temporal Planning over Dense Time AAAI 2020
TouIST: a Friendly Language for Propositional Logic and More IJCAI 2020
Epistemic Integrity Constraints for Ontology-Based Data Management AAAI 2020
Towards Universal Languages for Tractable Ontology Mediated Query Answering AAAI 2020
Training Linear Finite-State Machines NIPS 2020
Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem IJCAI 2020
Exact yet Efficient Graph Parsing, Bi-directional Locality and the Constructivist Hypothesis ACL 2020
On the Expressivity of ASK Queries in SPARQL AAAI 2020
Multi-Tiered Strictly Local Functions ACL 2020
DRS at MRP 2020: Dressing up Discourse Representation Structures as Graphs EMNLP 2020
A Novel Cascade Binary Tagging Framework for Relational Triple Extraction ACL 2020
Fast and Accurate Non-Projective Dependency Tree Linearization ACL 2020
Weighted Automata Extraction from Recurrent Neural Networks via Regression on State Spaces AAAI 2020
Weakly deterministic transformations are subregular ACL 2019
Equiprobable mappings in weighted constraint grammars ACL 2019
From Horn-SRIQ to Datalog: A Data-Independent Transformation That Preserves Assertion Entailment AAAI 2019
Action-Sensitive Phonological Dependencies ACL 2019
Bi-Kronecker Functional Decision Diagrams: A Novel Canonical Representation of Boolean Functions AAAI 2019
DepDist: Surface realization via regex and learned dependency-distance tolerance EMNLP 2019