Constructive negation for constraint logic programming

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

66 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings - Symposium on Logic in Computer Science
PublisherIEEE, Institute of Electrical and Electronics Engineers
Pages328-339
Number of pages12
ISBN (Print)081862230X
Publication statusPublished - 1 Jul 1991
Externally publishedYes
EventProceedings of the 6th Annual IEEE Symposium on Logic in Computer Science - Amsterdam, Neth
Duration: 15 Jul 199118 Jul 1991

Publication series

NameProceedings - Symposium on Logic in Computer Science

Conference

ConferenceProceedings of the 6th Annual IEEE Symposium on Logic in Computer Science
CityAmsterdam, Neth
Period15/07/9118/07/91

Cite this