Negation and control in PROLOG
From MaRDI portal
Publication:1082058
zbMath0602.68006MaRDI QIDQ1082058
Publication date: 1986
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
completenesslogic programslogic programmingsoundnessnegation as failureSLD resolutioncontrol rulescontrol facilitiescontrol primitivesdatabase style programmingMU-PrologProlog implementationRecursive predicates
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)
Related Items (17)
Stratified least fixpoint logic ⋮ A self-applicable partial evaluator and its use in incremental compilation ⋮ Constraint logic programming with dynamic scheduling: A semantics based on closure operators ⋮ Verification of logic programs with delay declarations ⋮ A logical semantics for depth-first Prolog with ground negation ⋮ Fifty Years of Prolog and Beyond ⋮ A pearl on SAT and SMT solving in Prolog ⋮ Replacing unification by constraint satisfaction to improve logic program expressiveness ⋮ Transforming normal logic programs to constraint logic programs ⋮ 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 ⋮ Constraint satisfaction using constraint logic programming ⋮ Operational Semantics for Reexecution-based Analysis of Logic Programs with Delay Declarations ⋮ Agenda control for heterogeneous reasoners ⋮ Declarative error diagnosis ⋮ Towards Ludics Programming: Interactive Proof Search ⋮ Proving correctness of Constraint Logic Programs with dynamic scheduling
This page was built for publication: Negation and control in PROLOG
