Goals in the propositional horn⊃ language are monotone boolean circuits

Authors:
J. Gaintzarain;M. Hermo;M. Navarro
Affiliations:
Dpto de L.S.I., Facultad de Informática, San Sebastián, Spain;Dpto de L.S.I., Facultad de Informática, San Sebastián, Spain;Dpto de L.S.I., Facultad de Informática, San Sebastián, Spain
Venue:
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Year:
2005

Citing 9
Cited 1

A logical analysis of modules in logic programming

Journal of Logic Programming
Extending Horn clause logic with implication goals

Theoretical Computer Science
Cryptographic limitations on learning Boolean formulae and finite automata

Journal of the ACM (JACM)
Modularity in logic programming

Proceedings of the eleventh international conference on Logic programming
When won't membership queries help?

Selected papers of the 23rd annual ACM symposium on Theory of computing
A Strong Logic Programming View for Static Embedded Implications

FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Structured Sequent Calculi for Combining Intuitionistic and Classical First-Order Logic

FroCoS '00 Proceedings of the Third International Workshop on Frontiers of Combining Systems
Multiparadigm Logic Programming

Proceedings of the Third International Conference on Algebraic and Logic Programming
Translating a Modal Language with Embedded Implication into Horn Clause Logic

ELP '96 Proceedings of the 5th International Workshop on Extensions of Logic Programming

Translating propositional extended conjunctions of Horn clauses into Boolean circuits

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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 form of structuring programs in logic programming. Restricted to the propositional setting of this language, we prove that any goal in Horn⊃ can be translated into a monotone Boolean circuit which is linear in the size of the goal.