Translating propositional extended conjunctions of Horn clauses into Boolean circuits

DOI10.1016/j.tcs.2010.01.013zbMath1191.68148OpenAlexW2063987554MaRDI QIDQ964389

Jose Gaintzarain, Marisa Navarro, Montserrat Hermo, Paqui Lucio

Publication date: 15 April 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.01.013

zbMATH Keywords

Horn clausesBoolean circuitsBoolean formulasHorn\(^{\supset}\) clauses

Mathematics Subject Classification ID

Theory of programming languages (68N15) Logic programming (68N17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extending Horn clause logic with implication goals
• Relating monotone formula size and monotone depth of Boolean functions
• Uniform proofs as a foundation for logic programming
• N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure
• Structuring logic programs: a modal approach
• A logical analysis of modules in logic programming
• A Transformational Semantics of Static Embedded Implications of Normal Logic Programs
• Mathematical Foundations of Computer Science 2005

This page was built for publication: Translating propositional extended conjunctions of Horn clauses into Boolean circuits