Negation and control in PROLOG

MaRDI QIDQ1082058zbMATH OpenFDO

Authors Lee Naish

Publication date 1986

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

completenesscontrol facilitiescontrol primitivescontrol rulesdatabase style programminglogic programminglogic programsMU-Prolognegation as failureProlog implementationRecursive predicatesSLD resolutionsoundness

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Logic programming (68N17) Theory of computing (68Q99)

Review text

Ways of bringing Prolog closer to the ideals of logic programming are investigated. First various implementations of negations are reviewed (all solutions predicates, delaying until ground, negative unifiers, program transformations,...). Possible pittfals of that variants are illustrated on examples. Delaying until ground technique is found to be generally the most efficient form of negations for database style programming. Recursive predicates are proposed to be transformed, if possible. The second part of the book is devoted to problems concerning adding control facilities to Prolog. A model of execution of MU-Prolog system is given and control primitives (priority and wait) are introduced. An algorithm for generating control information is given and used in preprocessor for logic programs. The appropriate theoretical foundations of logic programming are re-examined and a generalized resolution (Heterogeneous SLD) is defined. It is shown that soundness and completeness still hold. Several of the ideas contained in the paper were implemented in MU- Prolog, the reference manual of which is enclosed as an appendix.

Recommendations

• scientific article; zbMATH DE number 3958694
• N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure
• scientific article; zbMATH DE number 4180779
• A transformational approach to negation in logic programming
• The Prolog not-predicate and negation as failure rule

Cited in

(21)

• A self-applicable partial evaluator and its use in incremental compilation
• Transforming normal logic programs to constraint logic programs
• Constraint satisfaction using constraint logic programming
• Stratified least fixpoint logic
• Constraint logic programming with dynamic scheduling: A semantics based on closure operators
• A logical semantics for depth-first Prolog with ground negation
• Agenda control for heterogeneous reasoners
• Efficient negation using abstract interpretation
• Automating control for logic programs
• scientific article; zbMATH DE number 3958694 (Why is no real title available?)
• Modelling Prolog Control
• A pearl on SAT and SMT solving in Prolog
• Operational semantics for reexecution-based analysis of logic programs with delay declarations
• Proving correctness of constraint logic programs with dynamic scheduling
• Verification of logic programs with delay declarations
• Towards Ludics Programming: Interactive Proof Search
• Declarative error diagnosis
• Fifty Years of Prolog and Beyond
• Execution of logic programs by iterative-deepening A\(^*\) SLD-tree search
• Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities
• Replacing unification by constraint satisfaction to improve logic program expressiveness

This page was built for publication: Negation and control in PROLOG

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1082058)