A necessary condition for constructive negation in constraint logic programming

DOI10.1016/S0020-0190(00)00046-6zbMath1339.68035DBLPjournals/ipl/DovierPR00WikidataQ57840355 ScholiaQ57840355MaRDI QIDQ294756

Agostino Dovier, Gianfranco Rossi, Enrico Pontelli

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000000466?np=y

zbMATH Keywords

formal semanticsprogramming languagesconstraint logic programmingautomatic theorem provingconstructive negation

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (4)

Implementing constructive intensional negation ⋮ Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming ⋮ Preface ⋮ Selective Unification in (Constraint) Logic Programming*

Cites Work

• What is failure? An approach to constructive negation
• Negation and constraint logic programming
• {log}: A language for programming in logic with finite sets
• Making prolog more expressive
• The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
• Logic programming and negation: A survey
• Constructive negation by pruning
• A transformational approach to negation in logic programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A necessary condition for constructive negation in constraint logic programming