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