Inferring Simple Solutions to Recursion-Free Horn Clauses via Sampling

DOI10.1007/978-3-662-46681-0_10zbMath1420.68077OpenAlexW594226166MaRDI QIDQ5194952

Hiroshi Unno, Tachio Terauchi

Publication date: 17 September 2019

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46681-0_10

zbMATH Keywords

solution spaceHorn clausepredicate variablesimple solutionatomic solution

Mathematics Subject Classification ID

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

Related Items (2)

Solving constrained Horn clauses over algebraic data types ⋮ The possibilistic Horn non-clausal knowledge bases

This page was built for publication: Inferring Simple Solutions to Recursion-Free Horn Clauses via Sampling