# 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
16 Citations
Combining Negation as Failure and Embedded Implications in Logic Programs
• Mathematics, Computer Science
• J. Log. Program.
• 1998
This paper develops a top-down query evaluation procedure, a Kripke/Kleene fixed point semantics, and a logical interpretation by means of a completion construction for a language which combines embedded hypothetical implications and negation as failure (NAF). Expand
An extended constraint deductive database: Theory and implementation
• Computer Science, Mathematics
• J. Log. Algebraic Methods Program.
• 2014
This work presents the theoretical foundations of Hereditary Harrop formulas with constraints and an implementation that shows the viability and expressive power of the proposal, and a stratified fixpoint semantics constitutes a suitable foundation for the system implementation. Expand
Elimination of Negation in a Logical Framework
This work adapts the idea of elimination of negation introduced in [17] for Horn logic to a fragment of higher-order HHF to isolate a set of programs where static and dynamic clauses do not overlap. Expand
$\alpha$Check: A mechanized metatheory model-checker
• Computer Science
• 2017
This article presents $\alpha$Check, a bounded model-checker for metatheoretic properties of formal systems specified using nominal logic, which is fully automatic, does not require expertise in theorem proving on the part of the user, and produces counterexamples in the case that a flaw is detected. Expand
αCheck: A mechanized metatheory model checker*
• Computer Science
• Theory and Practice of Logic Programming
• 2017
Abstract The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has receivedExpand
Mechanized metatheory model-checking
• Computer Science
• PPDP '07
• 2007
This paper considers the problem of bounded model-checking for metatheoretic properties of formal systems specified using nominal logic, and proposes an approach that is fully automatic, does not require expertise in theorem proving on the part of the user, and produces counterexamples in the case that a flaw is detected. Expand
A Strong Logic Programming View for Static Embedded Implications
• Computer Science
• FoSSaCS
• 1999
A new characterization of the language in [8] is presented which shows that Horn clause extended with embedded implications, viewed as FO⊃-theories, preserves all the attractive mathematical and computational properties that Horn clauses satisfy as first-order-theory. Expand
A General Modal Framework for the Event Calculus and Its Skeptical and Credulous Variants
• Mathematics, Computer Science
• J. Log. Program.
• 1996
The resulting temporal formalism, called the Generalized Modal Event Calculus (GMEC), extends considerably the expressive power of EC when information about the ordering of events is incomplete. Expand
Advances in Property-Based Testing for $α$Prolog
• Computer Science
• ArXiv
• 2016
An alternative to the negation elimination algorithm underlying αCheck that substantially improves its effectiveness is described and the checker performances w.r.t. two of its main competitors in the logical framework niche, namely the QuickCheck/Nitpick combination offered by Isabelle/HOL and the random testing facility in PLT-Redex. Expand
Declarative Semantics of Hypothetical Logic Programming with Negation as Failure
The rational semantics for hypothetical programs is introduced and the consequence of viewing the assumptions R in a hypothetical goal as an update request imposes a kind of update semantics on the semantics of P. Expand

#### References

SHOWING 1-10 OF 38 REFERENCES
On hereditary Harrop formulae as a basis for logic programming
A Kripke-like model for the extended class of programs for which negation is implemented by the Negation as Failure rule is given, based on the model theory developed by Miller for hereditary Harrop formulae. Expand
On Normal Forms and Equivalence for Logic Programs
It is shown how equivalence in this logic captures the notion of operational provability, in that logically equivalent programs are operationally equivalent, which suggests that the natural logic in which to study logic programming is a slightly stronger constructive logic than intuitionistic logic. Expand
N-Prolog: An Extension of Prolog with Hypothetical Implication II - Logical Foundations, and Negation as Failure
• D. Gabbay
• Computer Science, Mathematics
• J. Log. Program.
• 1985
The N-PROLOG computation of a goal G from the database P means logically that P h G in intuitionistic logic, and an additional computational rule called the restart rule is introduced, allowing one to replace, at any time of the computation, the current goal by the original goal. Expand
A Kripke-Kleene Semantics for Logic Programs
• M. Fitting
• Computer Science, Mathematics
• J. Log. Program.
• 1985
The use of conventional classical logic is misleading for characterizing the behavior of logic programs because a logic program, when queried, will do one of three things: succeed with the query,Expand
A Logical Analysis of Modules in Logic Programming
A logical language which extends the syntax of positive Horn clauses by permitting implications in goals and in the bodies of clauses is presented and it is shown how to build a Kripke-like model for programs by a fixed-point construction and shown that the operational meaning of implication is sound and complete for intuitionistic logic. Expand
Clausal Intuitionistic Logic I - Fixed-Point Semantics
A clausal language is presented that extends Horn-clause logic by adding negations and embedded implications to the righthand side of a rule, and interpreting these new rules intuitionistically, in a set of partial models. Expand
Uniform Proofs as a Foundation for Logic Programming
• Computer Science
• Ann. Pure Appl. Log.
• 1991
A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like programming languages is provided and it is shown that first-order and higher-order Horn clauses with classical provability are examples of such a language. Expand
Negation in Logic Programming
• K. Kunen
• Computer Science, Mathematics
• J. Log. Program.
• 1987
A complete interpreter for negation as failure in logic programming exists in theory, although it is pointed out that there are serious difficulties in building one that works well in practice. Expand
The Consistency of Negation as Failure
• T. Flannagan
• Computer Science, Mathematics
• J. Log. Program.
• 1986
Clark's attempt to validate negation as failure in first order logic is shown to contain some fundamental errors and it seems that the query evaluation process with negation interpreted as failure is of no practical use as a theorem prover. Expand
Fixed Point Theorems and Semantics: A Folk Tale
• Mathematics, Computer Science
• Inf. Process. Lett.
• 1982
This paper searches for the theorem on which the fixed point theory of recursion is based, and the difficulties encountered suggest that the authors are in the presence of a folk theorem as defined by David Hare. Expand