Name
Title | ||
|---|---|---|
Translating propositional extended conjunctions of Horn clauses into Boolean circuits |
Abstract | ||
|---|---|---|
Horn^@? is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a way of structuring programs in logic programming. We are interested in finding correct and efficient translations from Horn^@? programs into some representation type that, preserving the signature, allows us suitable implementations of these kinds of programs. In this paper we restrict to the propositional setting of Horn^@? and we study correct translations into Boolean circuits, i.e. graphs; into Boolean formulas, i.e. trees; and into conjunctions of propositional Horn clauses. Different results for the efficiencies of the transformations are obtained in the three cases. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.tcs.2010.01.013 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
clause body,Boolean formula,propositional extended conjunction,logic programming language,Boolean circuits,Boolean circuit,Horn clauses,correct translation,Horn ⊃ clauses,logic programming,Boolean formulas,propositional Horn clause,efficient translation,different result,usual Horn clause | Journal | 411 |
Issue | ISSN | Citations |
16-18 | Theoretical Computer Science | 0 |
PageRank | References | Authors |
0.34 | 12 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jose Gaintzarain | 1 | 6 | 1.83 |
| Montserrat Hermo | 2 | 55 | 10.77 |
| Paqui Lucio | 3 | 102 | 19.66 |
| Marisa Navarro | 4 | 158 | 28.20 |