Crossing the Syntactic Barrier: Hom-Disequalities for ${\mathcal H}_1$-Clauses

DOI10.1007/978-3-642-31606-7_26zbMath1297.68058OpenAlexW49006301MaRDI QIDQ2914718

Helmut Seidl, Andreas Reuß

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Paths, tree homomorphisms and disequalities for -clauses

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Crossing the Syntactic Barrier: Hom-Disequalities for ${\mathcal H}_1$-Clauses