Set constructors, finite sets, and logical semantics

Journal of Logic Programming

Volumn 38, Issue 1, 1999, Pages 55-77

  Jayaraman, Bharat ^a   Jana, Devashis ^a  

^a 226 Bell Hall ^*  (United States)

Author keywords

Finite sets; Freeness axioms; Herbrand structure; Logical consequence; Semantics; Set constructors; Set unification; Zermelo Fraenkel set theory

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORMAL LOGIC; THEOREM PROVING;

FINITE SETS; HERBRAND STRUCTURE; SET CONSTRUCTORS; ZERMELO-FRAENKEL SET THEORY;

SET THEORY;

EID: 0032738546     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(98)10012-2     Document Type: Article

References (29)

1. S. Abiteboul, S. Grumbach, A rule-based language with functions and sets, ACM Trans. on Database Systems 16 (1) (1991) 1-30.
2. C. Beeri, S. Naqvi, O. Shmueli, S. Tsur, Set constructors in a logic database language, J. Logic Programming 10 (1991) 181-232.
3. R. Boyer, E. Lusk, W. McCune, R. Overbeek, M. Stickel, L. Wos, Set theory in first-order logic: Clauses for Goedel's axioms, J. Automat. Reason. 2 (3) (1986) 287-327.
4. A. Dovier, E.G. Omodeo, E. Pontelli, G. Rossi, A logic programming language with finite sets, in: Proceedings of the Fight International Conference on Logic Programming, Paris, 1991, pp. 111-124.
5. A. Dovier, E.G. Omodeo, K. Pontelli, G. Rossi, A langwage for programming in logic with finite sets, J. Logic Programming 28 (1) (1996) 1-44.
6. A. Dovier, G. Rossi, Embedding extensional finite sets in CLP, in: Proceedings of the International Symposium on Logic Programming, Vancouver, BC, 1993, pp. 540-554.
7. A.A. Fraenkel, Y. Bar-Hillel, A. Levy, D. van Dalen, Foundations of Set Theory, North-Holland, Amsterdam, 1973.
8. C. Gervet, Conjunto: Constraint logic programming with finite set domains, in: Proceedings of the International Symposium on Logic Programming, Ithaca, New York, 1994, pp. 339-358.
9. G.P. Huet, A unification algorithm for typed λ-calculus, Theoret. Comput. Sci. 1(1) (1975) 27-57.
10. J. Jaffar, J.-L. Lassez, Constraint Logic Programming, in: Proceedings of the 14th ACM Symposium on Principles of Programming Languages, 1987, pp. 111-119.
11. D. Jana, Semantics of Subset-Logic Languages, Ph.D. dissertation. Department of Computer Science, SUNY-Buffalo, 1994.
12. D. Jana, B. Jayaraman, Set Constructors, Finite Sets, and Logical Semantics, Unpublished manuscript 1992, subsequently made available as TR 94-030, Department of Computer Science, SUNY-Buffalo, 1994.
13. B. Jayaraman, The SuRE Programming Framework, TR 91-11, SUNY -Buffalo, New York, 1991.
14. B. Jayaraman, Implementaton of subset-equational programming, J. Logic Programming 12 (4) 299-324.
15. B. Jayaraman, A. Nair, Subset-logic programming: Application and implementation, Proceedings of the JICSLP, Seattle, 1988, pp. 841-858.
16. B. Jayaraman, D.A. Plaisted, Functional programming with sets, in: Proceedings of the Third FPCA, Portland, Springer, 1987, pp. 194-210.
17. B. Jayaraman, D.A. Plaisted, Programming with equations, subsets, and relations, in: Proceedings of the North American Conference Logic Programming, Cleveland, 1989, pp. 1051-1068.
18. J.-P. Jouannaud, C. Kirchner, Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification, in: Computational Logic: Essays in Honor of Alan Robinson, MIT Press, Cambridge, MA, 1991, pp. 257-321.
19. D. Kapur, P. Narendran, A Unification Algorithm for ACI Theories (Preliminary Report), SUNY Albany Technical Report, 1993.
20. G.M. Kuper, Logic programming with sets, J. Comput. System Sci. 41 (1) (1990) 44-64.
21. B. Legeard, E. Legros, Short overview of the CLPS system, in: Proceedings of the Programming Language Implementation and Logic Programming (PLILP), 1991, pp. 431-433.
22. J.W. Lloyd, Foundations of Logic Programming, Springer, Berlin, 1987.
23. Z. Manna, R. Waldinger, The Logical Basis for Computer Programming: Deductive Reasoning, vol. 1, Addison-Wesley, Reading, MA, 1985.
24. U. Martin, T. Nipkow, Unification in Boolean rings, in: Proceedings of the Eighth Conference on Automated Deduction. Leture Notes on Computer Science 230, Springer, 1986, pp. 506-513.
25. G. Nadathur, D. Miller, Higher-order horn clauses, J. Assoc. Comput. Mach. 31 (1989) 777-814.
26. S. Naqvi, S. Tsur, A Logical Language for Data and Knowledge Bases, Computer Science Press, New York, 1989.
27. J. Siekmann, Unification Theory, J. Symbolic Comput. 7 (1) (1989) 207-274.
28. F. Stolzenburg, An algorithm for general set unification and its complexity, J. Automat. Reason., . 1995.
29. P. Suppes, Axiomatic Set Theory, Dover edn., 1960; New York, 1972.