Normalization of linear Horn clauses

DOI10.1007/978-3-642-19829-8_16MaRDI QIDQ2999324zbMATH OpenOpenAlexFDO

Authors Thomas Martin Gawlitza, Helmut Seidl, Kumar Neeraj Verma

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

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

Recommendations

• scientific article; zbMATH DE number 1948386
• On word problems in Horn theories
• Solving non-linear Horn clauses using a linear Horn clause solver
• Horn clause solvers for program verification
• scientific article; zbMATH DE number 1555187

Cites work

• CONCUR 2005 – Concurrency Theory
• Deciding H₁ by resolution
• scientific article; zbMATH DE number 1232241 (Why is no real title available?)
• scientific article; zbMATH DE number 1263840 (Why is no real title available?)
• scientific article; zbMATH DE number 1341618 (Why is no real title available?)
• scientific article; zbMATH DE number 1948386 (Why is no real title available?)
• Iterative Specialisation of Horn Clauses
• On the security of public key protocols
• The regular viewpoint on PA-processes
• Verification, Model Checking, and Abstract Interpretation

Cited in

(2)

• A linear algorithm for renaming a set of clauses as a Horn set
• scientific article; zbMATH DE number 1948386 (Why is no real title available?)

This page was built for publication: Normalization of linear Horn clauses

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