Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345zbMATH Open1156.68326OpenAlexW2494705596MaRDI QIDQ5492873FDOQ5492873

Authors:

Publication date: 20 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11549345

Recommendations

• Translating propositional extended conjunctions of Horn clauses into Boolean circuits
• Extending Horn clause logic with implication goals
• scientific article; zbMATH DE number 4160108
• Extended Horn sets in propositional logic
• Pseudo-Boolean valued Prolog

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (3)

• Translating propositional extended conjunctions of Horn clauses into Boolean circuits
• Clausal intuitionistic logic I. fixed-point semantics
• Construction and learnability of canonical Horn formulas

This page was built for publication: Mathematical Foundations of Computer Science 2005

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