Success and Failure for Hereditary Harrop Formulae

@article{Harland1993SuccessAF,
  title={Success and Failure for Hereditary Harrop Formulae},
  author={J. Harland},
  journal={J. Log. Program.},
  year={1993},
  volume={17},
  pages={1-29}
}
  • J. Harland
  • Published 1993
  • Computer Science
  • J. Log. Program.
Abstract We introduce the foundational issues involved in incorporating the NEGATION as FAILURE (NAF) rule into the framework of first-order hereditary Harrop formulae of Miller et al. This is a larger class of formulae than Horn clauses, and so the technicalities are more intricate than in the Horn clause case. As programs may grow during execution in this framework, the role of NAF and the CLOSED WORLD ASSUMPTION (CWA) need some modification, and for this reason we introduce the notion of a… Expand
Combining Negation as Failure and Embedded Implications in Logic Programs
An extended constraint deductive database: Theory and implementation
Elimination of Negation in a Logical Framework
$\alpha$Check: A mechanized metatheory model-checker
αCheck: A mechanized metatheory model checker*
Mechanized metatheory model-checking
Advances in Property-Based Testing for $α$Prolog
...
1
2
...

References

SHOWING 1-10 OF 38 REFERENCES
On Normal Forms and Equivalence for Logic Programs
A Kripke-Kleene Semantics for Logic Programs
  • M. Fitting
  • Computer Science, Mathematics
  • J. Log. Program.
  • 1985
A Logical Analysis of Modules in Logic Programming
Clausal Intuitionistic Logic I - Fixed-Point Semantics
Negation in Logic Programming
  • K. Kunen
  • Computer Science, Mathematics
  • J. Log. Program.
  • 1987
The Consistency of Negation as Failure
  • T. Flannagan
  • Computer Science, Mathematics
  • J. Log. Program.
  • 1986
Fixed Point Theorems and Semantics: A Folk Tale
...
1
2
3
4
...