Crossing the Syntactic Barrier: Hom-Disequalities for ${\mathcal H}_1$-Clauses
From MaRDI portal
Publication:2914718
DOI10.1007/978-3-642-31606-7_26zbMath1297.68058MaRDI QIDQ2914718
Publication date: 20 September 2012
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31606-7_26
68Q45: Formal languages and automata
03B70: Logic in computer science
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Cites Work
- Deciding \(\mathcal H_1\) by resolution
- Extending \(H_1\)-clauses with disequalities
- The HOM problem is decidable
- Extending ${\cal H}_1$ -Clauses with Path Disequalities
- Bottom-Up Tree Automata with Term Constraints
- Verification, Model Checking, and Abstract Interpretation
- Unnamed Item
- Unnamed Item
- Unnamed Item