# 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} }

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

#### Topics from this paper

#### 11 Citations

A Proof-Theoretic Analysis of Goal-Directed Provability

- Mathematics, Computer Science
- J. Log. Comput.
- 1994

Goal-Directed Proof Search in Multiple-Conclusions Intuitionistic Logic

- Computer Science
- Computational Logic
- 2000

#### References

SHOWING 1-10 OF 14 REFERENCES

Equivalences of Logic Programs

- Computer Science, Mathematics
- Foundations of Deductive Databases and Logic Programming.
- 1988

Structural Properties of Logic Programs Published as Australian Computer Science Communica- tions:13:1

- Proceedings of the Fourteenth Australian Computer Science Conference
- 1991