Languages for Programming with Sets

E. G. Omodeo and A. Policriti. Decision Procedures for Set/Hyperset Contexts. In Alfonso Miola ed., Design and implementation of symbolic computation systems, (International Symposium DISCO'93, Gmunden, Austria), Volume 722 of LNCS, 192-215, Springer-Verlag, 1993.
PONTELLI, E. Logic programming with sets: Theory and implementation. Master's thesis, University of Houston, Houston, TX, 1992.
D.Fogli, M.Gaspari, and G.-F.Rossi. Adding sets and multisets to Gödel. Presented at the workshop on programming in Gödel, University of Manchester, 14-15 April, 1994.
GERVET, C. Conjuncto: Constraint logic programming with finite set domains. Tech. Rep. ECRC-94-15, ECRC, Munich, 1994.
AIKEN, A. Set Constraints: Results, Applications, and Future Directions. Proc. of PPCP'94: 2 tex2html_wrap_inline147 Workshop on Principles and Practice of Constraint Programming, A.Borning, Ed., May 1994. Seattle (WA).
B. Legeard, H. Lombardi, F. Ambert and M. Hibti. Constraints over Homogeneous Hereditarily Finite Sets. In Workshop on Logic Programming with Sets, in conjunction with ICLP '93, Budapest, 1993.
S.Abiteboul, S.Grumbach, COL: A Logic-Based Language for Complex Objects, Proc. Workshop on Database Programming Languages, Sept. 1987, pages 253-276.
W.Chen, M.Kifer, D.S.Warren, C-Logic of Complex Objects, Proc. 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of DataBase Systems, Philadelphia, March 1989, 369-378.
W.Chen, M.Kifer, D.S.Warren, HiLog: a first-order semantics for Higher-order Logic Programming Constructs, NACLP89, Cleveland, Oct. 1989.
S.Conrad, M.Gogolla. An Annoted Bibliography on Object-Orientation and Deduction, ACM Sigmod Record, vol.21, n.1, March 1992, pp.123-131.
E.Dahlhaus, J.A.Makowsky. The choice of programming primitives for SETL-like programming languages. Dept. of Computer Science, Technion, Haifa, Israel,1985.
E-E.Doberkat. Integrating Persistence into a Set-Oriented Prototyping Language, Structured Programming, Springer-Verlag, vol.13, 1992, pp.137-153.
V.Donzeau-Gouge, C.Dubois, P.Facon, F.Jean, Development of a Programming Environment for Setl, ESEC'87, Springer-Verlag, 1987,pages 21-32.
N.Immerman, S.Patnaik, D.Stemple. The Expressiveness of a Family of Finite Set Languages, Proc. 10th ACM Symp. on Principles of Database Systems, 1991.
B.Jayaraman, D.A.Plaisted, Functional Programming with Sets, 3rd Int. Conf. on Functional Programming and Computer Architecture, Portland, Sept. 1987, 194-210.
B.Jayaraman, A.Nair. Subset-logic Programming: Application and Implementation. Proc. 5th Int. Logic Programming Conf., The MIT Press,1988, 843-848.
P.Kruchten, E.Schonberg, J.T.Schwartz, Software prototyping using the SETL programming language, IEEE Software, vol.1, no 4, 1984, 66-75.
L.Naish, All solutions Predicates in Prolog, Proc. of the 2nd IEEE Symp. on Logic Programming, Boston, 1985, 73-77.
R.Paige, F.Henglein, Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study, Eurocal'85, Lecture Notes in Computer Science 204, 554-567, Springer- Verlag, 1985.
L.M.Pereira, A.Porto, All solutions, Logic Programming Newsletters, 2, 1981, 9-10.
E.Schonberg, J.T.Schwartz, M.Sharir, An automatic technique for selection of data representations in Setl programs, ACM TOPLAS, v.3, no 2, 1981, 126-143.
F.S.K.Silbermann, B.Jayaraman, Set abstraction in functional and logic programming, 4th Int. Conf. on Functional Programming and Computer Architecture, Sept. 1989.
D.Turner, Miranda: A non-strict functional language with polimorphic types, Int. Conf. on Functional Programming and Computer Architecture, Nancy, Sept. '85, 1-16.
T.Yakomori, A note on the set abstraction in logic programming language, Proc. of the Int. Conf. on Fifth Generation Computer Systems, Tokyo, Nov. 1984, 333-340.
Breazu-Tannen, Subrahmanyan Logical and Computational Aspects of Programming with Sets/Bags/Lists, 18th ICALP, 1991.
K.Vadaparty. On the Power of Rule-Based Languages with Sets, ACM SIGMOD Int. Conf. on Manipilation of Data, 1991.
Gordin, Pasik. Set-Oriented Constructs, ACM SIGMOD Int. Conf. on Manipulation of Data, 1991.
J.Allgayer. SB-ONE+ - dealing with sets efficiently, ECAI 90, 1990.
Nipkow. Non-deterministic Data Types: Models and Implementations, Acta Informatica, v. 22, 1986, p. 629-661.
Comon H. Completion of Rewrite Systems with Membership Constraints ICALP 92, 1992.
VAUGHT, R. L. On a Theorem of Cobham Concerning Undecidable Theories. In Proceedings of the 1960 International Concress (1962), E. Nagel, P. Suppes, and A. Tarski, Eds., Stanford University Press, Stanford, 14-25.
M. Thielscher and S. Holldobler. On Logic Programming with Multisets. In Proc. ICLP93 post-conference workshop on Logic Programming with Sets, 1993.
M.Pellegrini, R.Sepe, SetLog, a Tool for Experimenting with New Semantics, ACM SIGPlan Notices, 1991.
A.Policriti, Note su SETLOG e 'Desiderata for Logic Programming with sets, unpublished manuscript, 1989.
P.Kruchten, E.Schonberg, J.T.Schwartz, Software prototyping using the SETL programming language, IEEE Software, vol.1, no 4, 1984, 66-75.
J. Katzenelson, Higher level programming and data abstractions - A case study using enhanced C, Software-Practice and experience, Vol.13, 577-595, 1983.
L. Matyska, Logic Programming with Fuzzy Sets, Technical Report, City University, London, 1993.
L. Spratt, A. Ambler. A Visual Logic Programming Language Based on Sets and Partitioning Constraints, IEEE Symposium on Visual Languages, IEEE Computer Society, 1993.
L. Spratt. Seeing the Logic of Programming with Sets, Ph.D. Dissertation, Computer Science Department, University of Kansas, 1996.
GERVET, C. Conjuncto: Constraint logic programming with finite set domains. International Symposium on Logic Programming, MIT Press, pg. 339-358, 1994. [Description of the Conjunto Language: CLP with set intervals]
GERVET, C. Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Framework . In Constraints, Volume 1, Number 3.
J.J. Bisschop and R. Fourer. New Constructs for the Description of Combinatorial Optimization Problems in Algorithmic Modeling Languages. In Computational Optimization and Applications, Volume 6, Number 1, 1996.
R. Fourer. Extending a General-Purpose Algebraic Modeling Language to Combinatorial Optimizations: A Logic Programming Approach. In Advances in Computational and Stochastic Optimization, Logic Programming, and Heurstic Search, pp. 31-74, Kluwer Academic Press, 1998.
T. Grust, J. Kroeger, D. Gluche, A. Heuer, M.H. Scholl.. Query Evalutation in CROQUE: Algebra and Calculus Coincide. In Proceedings of the 15th British National Conference on Databases (BNCOD15), pp. 84-100, Springer Verlag, 1997.
N. Dean. The Essence of Discrete Mathematics. Prentice Hall, 1997.
N. Dean and M.G. Hinchey. Teaching and Learning Formal Methods. Academic Press, 1996.
J.-H. Byon and P.Z. Revesz. DISCO: A Constraint Database System with Sets. In Proc. Workshop on Constraint Databases and Applications. LNCS 1034, Springer Verlag, pp. 68-83, 1995.
M. Liu. Relationlog: a Typed Extension to Datalog with Sets and Tuples. In Journal of Logic Programming. Volume 36, Number 3, 1998.
V.Yu. Sazonov. Hereditarily-finite sets, data bases and polynomial-time computability. In Theoretical Computer Science. Volume 119, Number 1, 1993.
V.Yu. Sazonov and A.P. Lisitsa. Delta-languages for sets and Sub-PTIME graph In DataBase Theory - ICDT. LNCS 893, Springer Verlag, pages 125-138, 1995.
A.P. Lisitsa and V.Yu. Sazonov. Bounded Hyperset Theory and Web-like Data Bases. In Computational Logic and Proof Theory. LNCS 1289, Springer Verlag, pages 172-185, 1997.
A.P. Lisitsa and V.Yu. Sazonov. Delta-languages for sets and LOGSPACE-computable graph transformers. In Theoretical Computer Science. Volume 175, Number 1, 1997.

Logic Programming Rsrch Association
Sat Nov 8 22:45:42 MST 1997