Paths, tree homomorphisms and disequalities for -clauses

DOI10.1017/S096012951700024XzbMath1401.68050OpenAlexW2772805889MaRDI QIDQ4961723

Helmut Seidl, Andreas Reuß

Publication date: 25 October 2018

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s096012951700024x

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)

Cites Work

• Unnamed Item
• 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
• Crossing the Syntactic Barrier: Hom-Disequalities for ${\mathcal H}_1$-Clauses
• A practical secret voting scheme for large scale elections
• Bottom-Up Tree Automata with Term Constraints
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation
• The HOM Problem is EXPTIME-Complete

This page was built for publication: Paths, tree homomorphisms and disequalities for -clauses