Constructive Negation and constraint logic programming with sets

New Generation Computing

Volumn 19, Issue 3, 2001, Pages 209-255

  Dovier, Agostino ^a   Pontelli, Enrico ^b   Rossi, Gianfranco ^c  

^a UNIVERSITY OF VERONA   (Italy)

^b New Mexico State University   (United States)

^c UNIVERSITY OF PARMA   (Italy)

Author keywords

Constraint logic programming; Constructive negation; Programming with sets

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; CONSTRAINT THEORY; PROGRAM INTERPRETERS; SET THEORY; SYNTACTICS;

CONSTRAINT LOGIC PROGRAMMING (CLP); CONSTRUCTIVE NEGATION (CN);

LOGIC PROGRAMMING;

EID: 0034959326     PISSN: 02883635     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF03037598     Document Type: Article

References (38)

1. Logic programming and negation: A survey
2. Matching of bounded set terms in the logic language LDL++
3. Automated deduction - A basis for applications
4. A transformation approach to negation in logic programming
5. Set constructors in a logic database language
6. A system of axiomatic set theory. Part I
7. Compiling intensional sets in CLP
8. A framework for the abstract interpretation of logic programs
9. Computable set theory
10. Constructive negation based on the completed database
11. An extension of constructive negation and its application in coroutining
12. Negation as failure
13. Abstract interpretation of logic programs: An abstract domain for groundness, sharing, freeness and compoundness analysis
14. Non-failure analysis for logic programs
15. Embedding extensional finite sets in CLP
16. (log): A language for programming in logic with finite sets
17. A uniform axiomatic view of lists, multisets, and sets, and the relevant unification algorithms
18. A necessary condition for constructive negation in constraint logic programming
19. What is failure? An approach to constructive negation
20. Constructive negation by pruning and optimization higher-order predicates for clp and cc languages
21. Constraint logic programming
22. Constraint logic programming: A survey
23. Negation in logic programming
24. Unification revisited
25. Complete axiomatizations of the algebras of finite, rational, and infinite trees
26. Axiomatizable classes of locally free algebras of various types
27. An efficient unification algorithm
28. How to incorporate negation in a prolog compiler
29. Combined determination of sharing and freeness of program variables through abstract interpretation
30. Logic programs with stable model semantics as a constraint programming paradigm
31. Extending relational algebra and relational calculus with set valued attributes and aggregate functions
32. On constructive negation in logic programming
33. Negation in logic programming
34. Unification theory
35. Negation and constraint logic programming
36. On a theorem of cobham concerning undecidable theories