Theorem Proving and Constraint
Handling

1

A. Aiken. Set Constraints: Results, Applications and Future Directions. Technical report, University of California, Berkeley, 1994.

2

A. Aiken, D. Kozen, M. Vardi, and E. Wimmers. The complexity of set constraints. In E. Börger, Y. Gurevich, and K. Meinke, editors, Proceedings 1993 Conference on Computer Science Logic, volume 832 of Lecture Notes in Computer Science, pages 1-17. Springer-Verlag, Berlin, 1993.

3

A. Aiken, D. Kozen, and E. Wimmers. Decidability of systems of set constraints with negative constraints. Technical report, Computer Science Department, Cornell University, june 1993.

4

A. Aiken and B. Murphy. Implementing regular tree expressions. In Proc. 1991 Conf. Functional Programming Languages and Computer Architecture, pages 427-447, 1991.

5

A. Aiken and B. Murphy. Static type inference in a dynamically typed language. In Proc. 18th Symp. Principles of Programming Languages, pages 279-290. ACM, 1991.

6

A. Aiken and E. Wimmers. Solving systems of set constraints. In Proc. 7th Symp. Logic in Computer Science, pages 329-340. IEEE, 1992.

7

D. Aliffi, A. Dovier, E. G. Omodeo, and G. Rossi. Unification of hyperset terms. Unpublished proc. of Workshop on Logic Programming with Sets, in conjunction with ICLP'93, June 1993.

8

Arenas-Sánchez and A. Dovier. Minimal Set Unification. Tr 6/95, Dipartimento di Informatica, Univ. di Pisa, April 1995.

9

P. Arenas-Sánchez and A. Dovier. Minimal Set Unification. In M. Hermenegildo and S. Doaitse Swierstra, editors, Proc. Seventh Int'l Symp. on Programming Language Implementation and Logic Programming, volume 982, pages 397-414. Springer Verlag, 1995.

10

P. Arenas-Sánchez and A. Dovier. Minimal Set Unification. In M. Alpuente and M. I. Sessa, editors, GULP-PRODE'95 1995 Joint Conf. on Declarative Programming, pages 447-458, September 1995. Marina di Vietri (SA).

11

F. Baader and W. Büttner. Unification in commutative and idempotent monoids. Theoretical Computer Science, 56:345-352, 1988.

12

L. Bachmair, H. Ganziger, and U. Waldmann. Set constraints are the monadic class. In Proc. 8th Symp. Logic in Computer Science, pages 75-83. IEEE, 1993.

13

D. Benanav, D. Kapur, and P. Narendran. Complexity of Matching Problems. Journal of Symbolic Computing, 3:203-216, 1987.

14

H-J. Bürckert, A. Herold, D. Kapur, J. H. Siekmann, M. E. Stickel, M. Tepp, and H. Zhang. Opening the AC-Unification Race. Journal of Automated Reasoning, 4(4):465-474, 1988.

15

W. Büttner. Unification in the Data Structure Sets. In J. K. Siekmann, editor, Proc. of the Eight International Conference on Automated Deduction, volume 230, pages 470-488. Springer Verlag, 1986.

16

W. Büttner and H. Simonis. Embedding Boolean Expressions into Logic Programming. Journal of Symbolic Computing, 4:191-205, 1987.

17

W. Charatonik and L. Pacholski. Negative set constraints with equality. In Proc. 9th Symp. Logic in Computer Science. IEEE, 1994.

18

M. Codish and V. Lagoon. Tyme Dependencies for Logic Programs Using ACI-Unification. Technical report, Department of Mathematics and Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel, 1996.

19

M. Codish, V. Lagoon, and F. Bueno. Sharing Analysis for Logic Programs using Set Logic programs. Technical report, Department of Mathematics and Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel, 1996.

20

Michael Codish, Dennis Dams, Gilberto Filè, and Maurice Bruynooghe. On the design of a correct freeness analysis for logic programs. Journal of Logic Programming, 28(3):181-206, 1996.

21

Michael Codish, Gilberto Filè, and William Winsborough. Optimal groundness analysis using propositional logic. Journal of Logic Programming, 27(2):137-167, 1996.

22

A. Dovier, E. G. Omodeo, and A. Policriti. Hyperset constraint handling. Rr 21/94, Dipartimento di Matematica ed Informatica, Univ. di Udine, December 1994.

23

A. Dovier, E. G. Omodeo, and A. Policriti. Hyperset constraint handling ii: Reduction to the pure case and (partial) completeness analysis. Work in progress, 1995.

24

A. Dovier, E. G. Omodeo, A. Policriti, and G. Rossi. Solving Systems of Equations over Hypersets. In M. Alpuente, R. Barbuti, and I. Ramos, editors, GULP-PRODE'94 1994 Joint Conf. on Declarative Programming, pages 403-417, 1994.

25

A. Dovier, A. Policriti, and G. Rossi. Integrating lists, multisets, and sets in a logic programming framework. In F. Baader and K. U. Schulz, editors, First International Workshop on Frontiers of Combining Systems, volume 3 of Applied Logic, pages 213-229. Kluwer Academic Press, 1996. March 26-29, Munich.

26

R. Gilleron, S. Tison, and M. Tommasi. Solving system of set constraints with negated subset relationships. In Proc. 34th Symp. Foundations of Computer Science, pages 372-380. IEEE, 1993.

27

R. Gilleron, S. Tison, and M. Tommasi. Solving systems of set constraints using tree automata. In Proc. Symp. Theoretical Aspects of Computer Science, volume 665 of Lecture Notes in Computer Science, pages 505-514. Springer-Verlag, Berlin, 1993.

28

R. Gilleron, S. Tison, and M. Tommasi. Some new Decidability Results on Positive and Negative Set Constraints. Technical report, Université de Lille I, 1994.

29

N. Heintze and J. Jaffar. A Decision Procedure for a Class of Set Constraints. In Proc. 5th Symp. Logic in Computer Science, pages 42-51. IEEE, 1990.

30

N. Heintze and J. Jaffar. Set Constraints and Set-Based Analysis. Technical report, Carnegie Mellon University, 1994.

31

M. Hermann and P.G. Kolaitis. The complexity of counting problems in equational matching. In A. Bundy, editor, Proceedings 12th International Conference on Automated Deduction, Nancy (France), volume 814 of Lecture Notes in Artificial Intelligence, pages 560-574. Springer Verlag, June 1994. To appear in Journal of Symbolic Computation.

32

D. Jacobs and A. Langen. Static analysis of logic programs for independent and parallelism. Journal of Logic Programming, 12(2 and 3):291-314, 1992.

33

D. Kapur and P. Narendran. NP-completeness of the set unification and matching problems. In J. H. Siekmann, editor, 8th International Conference on Automated Deduction, volume 230 of Lecture Notes in Computer Science, pages 489-495. Springer Verlag, 1986.

34

D. Kapur and P. Narendran. Complexity of Unification Problems with Associative-Commutative Operators. Journal of Automated Reasoning, 9:261-288, 1992.

35

D. Kozen. Logical Aspects of Set Constraints. In E. Börger, Y. Gurevich, and K. Meinke, editors, Proceedings 1993 Conference on Computer Science Logic, volume 832 of Lecture Notes in Computer Science, pages 175-188. Springer-Verlag, Berlin, 1993.

36

D. Kozen. Set Constraints and Logic Programming. Technical report 94-1467, Computer Science Department, Cornell University, 1994.

37

M. Livesey and J. Siekmann. Unification of Sets and Multisets. Technical report, Institut für Informatik I, Universität Karlsruhe, 1976.

38

K. Stefánsson. Systems of set constraints with negative constraints are NEXPTIME-complete. In Proc. 9th Symp. Logic in Computer Science. IEEE, 1994.

39

F. Stolzenburg. An Algorithm for General Set Unification and its Complexity. In Proc. Workshop on Logic Programming with Sets, June 1993. Budapest.

40

F. Stolzenburg. Membership-constraints and Complexity in Logic Programming with Sets. In Proc. Frontiers in Combining Systems, Kluwer Academic Press, pp. 285-302, 1996.

41

F. Stolzenburg. An Algorithm for General Set Unification and Its Complexity. In Journal of Automated Reasoning, Vol. 22, No. 1, 1999.

42

L. Naish. Mode Checking Using Constrained Regular Trees. Technical Report, Dept. Computer Science, University of Melbourne, 1998.