Debugging Systems for Constraint Programming Esprit 22532 Task T.wp2.1: Declarative Debugging in Constraint Programming Correctness and Completeness of Clp Semantics Revisited with (co-)induction

@inproceedings{Tessier2007DebuggingSF,
  title={Debugging Systems for Constraint Programming Esprit 22532 Task T.wp2.1: Declarative Debugging in Constraint Programming Correctness and Completeness of Clp Semantics Revisited with (co-)induction},
  author={Alexandre Tessier},
  year={2007}
}
We propose a reformulation of the constraint logic program semantics in terms of positive and negative semantics, using a uniform inductive framework. It is a natural and elegant way to express and study correctness and completeness results. In particular we state a completeness for negative semantics by using some in nite sets of constraints. This theoretical framework is an original extension of the \Grammatical View of Logic Programming". 

References

Publications referenced by this paper.
SHOWING 1-10 OF 18 REFERENCES

Constraint Logic Programming: A Survey

  • J. Log. Program.
  • 1994
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Clari cation of the bases of Declarative Diagnosers for CLP

G erard Ferrand, Alexandre Tessier
  • Deliverable D.WP2.1.M1.1-1,
  • 1997
VIEW 3 EXCERPTS

Constructive Negation by Pruning

  • J. Log. Program.
  • 1997
VIEW 1 EXCERPT

Une caract erisation des arbres SLD en programma- tion logique avec contraintes

Alexandre Tessier
  • In Philippe Devienne, editor, actes du pôle Contraintes et Programmation Logique,
  • 1996
VIEW 1 EXCERPT