Normalization of linear Horn clauses

DOI10.1007/978-3-642-19829-8_16zbMATH Open1325.68130OpenAlexW1672320438MaRDI QIDQ2999324FDOQ2999324

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Title not available (Why is that?)
• A linear algorithm for renaming a set of clauses as a Horn set

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)