Timon Barlag
2 indexed papers
Publications per year
Top categories
Frequent co-authors
Research Timeline
The paper establishes that for quantifier-free dependence logic formulas, the property of k-coherence is equivalent to first-order rewritability, and analyzes the computational complexity of checking this coherence property.
The paper establishes that for quantifier-free dependence logic formulas, the property of k-coherence is equivalent to first-order rewritability, and analyzes the computational complexity of checking this coherence property.
Papers
Aspects of Coherence in Dependence Logic
The paper establishes that for quantifier-free dependence logic formulas, the property of k-coherence is equivalent to first-order rewritability, and analyzes the computational complexity of checking…