conftrace_
← Foundations
Computer Science › Foundations ›

Formal Languages

113 papers

Papers per year

1
13
7
'15
'20
'25

Papers

A PSPACE Subclass of Dependency Quantified Boolean Formulas and Its Effective Solving AAAI 2019
Regular Boardgames AAAI 2019
Unbounded Orchestrations of Transducers for Manufacturing AAAI 2019
Relaxing and Restraining Queries for OBDA AAAI 2019
Extension Removal in Abstract Argumentation – An Axiomatic Approach AAAI 2019
From Horn-SRIQ to Datalog: A Data-Independent Transformation That Preserves Assertion Entailment AAAI 2019
Qualitative Spatial Logic over 2D Euclidean Spaces Is Not Finitely Axiomatisable AAAI 2019
Partial Awareness AAAI 2019
Bi-Kronecker Functional Decision Diagrams: A Novel Canonical Representation of Boolean Functions AAAI 2019
On Limited Conjunctions and Partial Features in Parameter-Tractable Feature Logics AAAI 2019
Equiprobable mappings in weighted constraint grammars ACL 2019
Weakly deterministic transformations are subregular ACL 2019
Action-Sensitive Phonological Dependencies ACL 2019
DepDist: Surface realization via regex and learned dependency-distance tolerance EMNLP 2019
The Complexity of Model Checking Knowledge and Time IJCAI 2019
Constraining MGbank: Agreement, L-Selection and Supertagging in Minimalist Grammars ACL 2018
Clausal Modifiers in the Grammar Matrix COLING 2018
A Syntax-Based Scheme for the Annotation and Segmentation of German Spoken Language Interactions COLING 2018
Computational Challenges for Polysynthetic Languages COLING 2018
Modeling Reduplication with 2-way Finite-State Transducers EMNLP 2018
Sanskrit n-Retroflexion is Input-Output Tier-Based Strictly Local EMNLP 2018
Interactive Robot Transition Repair With SMT IJCAI 2018
On the Equivalence between Assumption-Based Argumentation and Logic Programming (Extended Abstract) IJCAI 2018
SynKit: LTL Synthesis as a Service IJCAI 2018
Query Rewriting for DL-Lite with n-ary Concrete Domains IJCAI 2017