A necessary condition for constructive negation in constraint logic programming
From MaRDI portal
Publication:294756
DOI10.1016/S0020-0190(00)00046-6zbMath1339.68035WikidataQ57840355 ScholiaQ57840355MaRDI QIDQ294756
Enrico Pontelli, Gianfranco Rossi, Agostino Dovier
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
formal semantics; programming languages; constraint logic programming; automatic theorem proving; constructive negation
68N17: Logic programming
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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