@inproceedings{75f72f06ba8c4912803f09228aa0c602,

title = "Constructive negation for constraint logic programming",

abstract = "Constructive negation is an extension of the negation as failure rule to handle nonground negative subgoals in a constructive manner. It entails the following procedure: nodes of the subderivation for the nonground negative subgoal are collected as a disjunction and negated giving a formula equivalent to the negative subgoal. Constructive negation was formulated for logic programming in the Herbrand universe by introducing disequality constraints. A framework for constructive negation for constraint logic programming over arbitrary structures that is sound and complete with respect to the three-valued consequences of the completion of a program is described, and a simpler, more efficient form of constructive negation for the Herbrand universe is obtained. What makes a structure particularly suited to the use of constructive negation is characterized, and this suitability condition is shown for a number of structures and classes of structures.",

author = "Stuckey, {Peter J.}",

year = "1991",

month = jul,

day = "1",

language = "English",

isbn = "081862230X",

series = "Proceedings - Symposium on Logic in Computer Science",

publisher = "IEEE, Institute of Electrical and Electronics Engineers",

pages = "328--339",

booktitle = "Proceedings - Symposium on Logic in Computer Science",

address = "United States of America",

note = "Proceedings of the 6th Annual IEEE Symposium on Logic in Computer Science ; Conference date: 15-07-1991 Through 18-07-1991",

}