Normalization of Linear Horn Clauses

DOI10.1007/978-3-642-19829-8_16zbMath1325.68130OpenAlexW1672320438MaRDI QIDQ2999324

Thomas Martin Gawlitza, Kumar Neeraj Verma, Helmut Seidl

Publication date: 12 May 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19829-8_16

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding \(\mathcal H_1\) by resolution
• On the security of public key protocols
• Iterative Specialisation of Horn Clauses
• Verification, Model Checking, and Abstract Interpretation
• CONCUR 2005 – Concurrency Theory
• The regular viewpoint on PA-processes

This page was built for publication: Normalization of Linear Horn Clauses