The following pages link to Negation and control in PROLOG (Q1082058):
Displaying 19 items.
- A pearl on SAT and SMT solving in Prolog (Q428887) (← links)
- Declarative error diagnosis (Q578894) (← links)
- Execution of logic programs by iterative-deepening A\(^*\) SLD-tree search (Q688625) (← links)
- Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities (Q688819) (← links)
- Replacing unification by constraint satisfaction to improve logic program expressiveness (Q912656) (← links)
- A self-applicable partial evaluator and its use in incremental compilation (Q1108782) (← links)
- Transforming normal logic programs to constraint logic programs (Q1200979) (← links)
- Constraint satisfaction using constraint logic programming (Q1204868) (← links)
- Stratified least fixpoint logic (Q1331926) (← links)
- Constraint logic programming with dynamic scheduling: A semantics based on closure operators (Q1368380) (← links)
- A logical semantics for depth-first Prolog with ground negation (Q1390936) (← links)
- Agenda control for heterogeneous reasoners (Q1764797) (← links)
- (Q3727351) (← links)
- Modelling Prolog Control (Q4286208) (← links)
- Operational Semantics for Reexecution-based Analysis of Logic Programs with Delay Declarations (Q4923517) (← links)
- Proving correctness of Constraint Logic Programs with dynamic scheduling (Q5030189) (← links)
- Verification of logic programs with delay declarations (Q5096380) (← links)
- Towards Ludics Programming: Interactive Proof Search (Q5504660) (← links)
- Fifty Years of Prolog and Beyond (Q6063890) (← links)
