Crossing the syntactic barrier: hom-disequalities for H₁-clauses

DOI10.1007/978-3-642-31606-7_26zbMATH Open1297.68058OpenAlexW49006301MaRDI QIDQ2914718FDOQ2914718

Authors: Andreas Reuss, Helmut Seidl 

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

Recommendations

• Paths, tree homomorphisms and disequalities for \(\mathcal H_1\)-clauses
• Extending \(H_1\)-clauses with disequalities
• Extending \({\mathcal H}_1\)-clauses with path disequalities
• scientific article; zbMATH DE number 1507192
• The HOM problem is decidable

Mathematics Subject Classification ID

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

Cites Work

• The HOM problem is decidable
• Title not available (Why is that?)
• Deciding \(\mathcal H_1\) by resolution
• Title not available (Why is that?)
• Bottom-Up Tree Automata with Term Constraints
• Extending \(H_1\)-clauses with disequalities
• Verification, Model Checking, and Abstract Interpretation
• Extending \({\mathcal H}_1\)-clauses with path disequalities
• Title not available (Why is that?)

Cited In (3)

• Paths, tree homomorphisms and disequalities for \(\mathcal H_1\)-clauses
• Extending \(H_1\)-clauses with disequalities
• Extending \({\mathcal H}_1\)-clauses with path disequalities

This page was built for publication: Crossing the syntactic barrier: hom-disequalities for \({\mathcal H}_1\)-clauses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914718)