Flat and one-variable clauses

DOI10.1145/1380572.1380577zbMath1367.68113OpenAlexW2131990213MaRDI QIDQ5277817

Kumar Neeraj Verma, Helmut Seidl

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1380572.1380577

zbMATH Keywords

first-order logicHorn clausesresolutioncryptographic protocolsinstantiation-based theorem proving

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case

This page was built for publication: Flat and one-variable clauses