Intensional sets in CLP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2916, Issue , 2003, Pages 284-299

  Dovier, A ^a   Pontelli, E ^b   Rossi, G ^c  

^a UNIVERSITY OF UDINE   (Italy)

^b NEW MEXICO STATE UNIVERSITY   (United States)

^c UNIVERSITY OF PARMA   (Italy)

Author keywords

Aggregates; Constraint logic programming; Sets

Indexed keywords

CONSTRAINT LOGIC PROGRAMMING; LOGIC PROGRAMS; SETS; CONSTRAINT RESOLUTIONS;

LOGIC PROGRAMMING; SEMANTICS; AGGREGATES; COMPUTATIONAL LINGUISTICS; COMPUTER CIRCUITS; COMPUTER PROGRAMMING LANGUAGES; RECONFIGURABLE HARDWARE;

AGGREGATES; LOGIC PROGRAMMING;

EID: 0346264954     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24599-5_20     Document Type: Conference Paper

References (21)

1. P. Arenas-Sánchez and M. Rodríguez-Artalejo. A General Framework for Lazy Funct'l Logic Programming with Algebraic Polymorphic Types. TPLP, 2(1), 2001.
2. C. Beeri, S. Naqvi, O. Shmueli, and S. Tsur. Set Constructors in a Logic Database Language. Journal of Logic Programming, 10(3):181-232, 1991.
3. A. Dal Palù, A. Dovier, E. Pontelli, and G. Rossi. Integrating Finite Domain Constraints and CLP with Sets. In PPDP'03, pp. 219-229. ACM Press, 2003.
4. M. Denecker et al. Ultimate well-founded and stable semantics for logic programs with aggregates. In ICLP, pp. 212-226. Springer, 2001.
5. A. Dovier, E. G. Omodeo, E. Pontelli, and G. Rossi. {log}: A Logic Programming Language with Finite Sets. In ICLP, pages 111-124. MIT Press, 1991.
6. A. Dovier, C. Piazza, E. Pontelli, and G. Rossi. Sets and Constraint Logic Programming. ACM TOPLAS, 22(5):861-931, 2000.
7. A. Dovier, E. Pontelli, and G. Rossi. A Necessary Condition for Constructive Negation in Constraint Logic Programming. IPL, 74(3-4):146-156, 2000.
8. A. Dovier, E. Pontelli, and G. Rossi. Constructive Negation and Constraint Logic Programming with Sets. New Generation Computing, 19(3):209-255, 2001.
9. M. Gelfond. Representing Knowledge in A-Prolog. In Computational Logic: Logic Programming and Beyond, pages 413-451. Springer Verlag, 2002.
10. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In JICSLP, pages 1070-1080. MIT Press, 1988.
11. C. Gervet. Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language. Constraints, 1:191-246, 1997.
12. J. Jaffar and M. J. Maher. Constraint Logic Programming: A Survey. Journal of Logic Programming, 19-20:503-581, 1994.
13. B. Jayaraman. Implementation of Subset-Equational Programs. Journal of Logic Programming, 12(4):299-324, 1992.
14. D. B. Kemp and P. J. Stuckey. Semantics of Logic Programs with Aggregates. In ILPS, pages 387-401. MIT Press, 1991.
15. G. M. Kuper. Logic Programming with Sets. JCSS, 41(1):66-75, 1990.
16. V. W. Marek and M. Truszczyński. Stable Models and an Alternative Logic Programming Paradigm. In The Logic Programming Paradigm. Springer Verlag, 1999.
17. I. Niemela and P. Simons. Extending Smodels with Cardinality and Weight Constraints. In Logic-Based Artificial Intelligence, pp. 491-521. Kluwer, 2000.
18. K. A. Ross and Y. Sagiv. Monotonic Aggregation in Deductive Databases. Journal of Computer ans System Science, 54:79-97, 1997.
19. K. A. Ross, D. Srivastava, P. J. Stuckey, and S. Sudarshan. Foundations of aggregation constraints. Theoretical Computer Science, 193(1-2):149-179, 1998.
20. J. T. Schwartz, R. B. K. Dewar, E. Dubinsky, and E. Schonberg. Programming with Sets: an Introduction to SETL. Springer, 1986.
21. A. Van Gelder. The Well-Founded Semantics of Aggregation. In 11th Principles of Database Systems, pages 127-138. ACM Press, 1992.