Corpus ID: 10585204

On Normal Forms and Equivalence for Logic Programs

@inproceedings{Harland1992OnNF,
  title={On Normal Forms and Equivalence for Logic Programs},
  author={J. Harland},
  booktitle={JICSLP},
  year={1992}
}
  • J. Harland
  • Published in JICSLP 1992
  • Mathematics, Computer Science
It is known that larger classes of formulae than Horn clauses may be used as logic programming languages. One such class of formulae is hereditary Harrop formulae, for which an operational notion of provability has been studied, and it is known that operational provability corresponds to prov-ability in intuitionistic logic. In this paper we discuss the notion of a normal form for this class of formulae, and show how this may be given by removing disjunctions and existential quantiications from… Expand
Success and Failure for Hereditary Harrop Formulae
A Proof-Theoretic Analysis of Goal-Directed Provability
  • J. Harland
  • Mathematics, Computer Science
  • J. Log. Comput.
  • 1994
Goal-Directed Proof Search in Multiple-Conclusions Intuitionistic Logic
Search Calculi for Classical and Intuitionistic Logic
Elimination of Negation in a Logical Framework
Logic Programming with Linear Logic
...
1
2
...

References

SHOWING 1-10 OF 14 REFERENCES
A Logical Analysis of Modules in Logic Programming
Equivalences of Logic Programs
  • Michael J. Maher
  • Computer Science, Mathematics
  • Foundations of Deductive Databases and Logic Programming.
  • 1988
Foundations of Logic Programming
Predicate Logic as Programming Language
“Memo” Functions and Machine Learning
Structural Properties of Logic Programs Published as Australian Computer Science Communica- tions:13:1
  • Proceedings of the Fourteenth Australian Computer Science Conference
  • 1991
...
1
2
...