Answers Synthesis for CLP with Negation (1996) [2 citations — 0 self]
Abstract:
Abstract. Rewrite techniques can be used to execute logic programs in order to avoid some drawbacks of classical Prolog resolution. Logic programs are represented as rewrite programs whose operational mechanism, inspired from Knuth-Bendix completion, allows to prune some unnecessary computations and offers a synthesis ability which enables to represent infinite sets of answers as finite sets of formulas. We extend this approach to CLP with negation. Our mechanism, integrating both non symbolic constraints and negation, keeps the loop avoiding and synthesis properties. Taking advantage of a simplification rule, the solutions are obtained as a set of constrained rewrite rules with more expressive power than simple constraints used in classical CLP resolution. The system is proved sound and complete with regard to the standard CLP semantics. 1
Citations
| 325 | Bilattices and the semantics of logic programming – Fitting - 1991 |
| 218 | Logic programming and negation: A survey – Apt, Bol - 1994 |
| 214 | Negation in logic programming – Kunen - 1987 |
| 124 | Constructive negation based on the complete database – Chan - 1988 |
| 123 | Negation and Constraint Logic Programming – Stuckey |
| 26 | Constructive Negation by Pruning – Fages - 1997 |
| 13 | On rewrite programs: semantics and relationship with Prolog – Bonacina, Hsiang - 1992 |
| 7 | A rewrite mechanism for logic programs with negation – Anantharaman, Richard - 1995 |
| 4 | Computing in The Completion – Bottoni, Levi - 1993 |
| 3 | A rewrite approach for constraint logic programming – Richard, Saubion - 1995 |
| 1 | Negation as Failure, Ed. Gallaire and Minker – Clark - 1978 |
