Translating propositional extended conjunctions of Horn clauses into Boolean circuits

DOI10.1016/J.TCS.2010.01.013MaRDI QIDQ964389zbMATH OpenOpenAlexFDO

Authors Jose Gaintzarain, M. Hermo, Marisa Navarro, P. 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

Boolean circuitsBoolean formulasHorn clausesHorn\(^{\supset}\) clauses

Mathematics Subject Classification ID

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

Recommendations

• Mathematical Foundations of Computer Science 2005
• Extended Horn sets in propositional logic
• scientific article; zbMATH DE number 4160108
• HORNLOG: A graph-based interpreter for general Horn clauses
• Extending Horn clause logic with implication goals

Cites work

• A logical analysis of modules in logic programming
• A Transformational Semantics of Static Embedded Implications of Normal Logic Programs
• Extending Horn clause logic with implication goals
• scientific article; zbMATH DE number 1330130 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1538011 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2005
• N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure
• Relating monotone formula size and monotone depth of Boolean functions
• Structuring logic programs: a modal approach
• Uniform proofs as a foundation for logic programming

Cited in

(2)

• Clausal intuitionistic logic I. fixed-point semantics
• Mathematical Foundations of Computer Science 2005

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

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