Tarskian set constraints

Information and Computation

Volumn 174, Issue 2, 2002, Pages 105-131

  Givan, Robert ^a   McAllester, David ^b   Witty, Carl ^c   Kozen, Dexter ^d  

^a Purdue University   (United States)

^b AT AND T LABS RESEARCH   (United States)

^c Newton Research Labs Inc   (United States)

^d Upson Hall ^*  (United States)

Author keywords

Decision procedures; Dynamic logic; Mu calculus; Set constraints

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PROBLEM SOLVING; SEMANTICS;

SET CONSTRAINTS;

SET THEORY;

EID: 0036590513     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.2973     Document Type: Article

References (33)

1. Aiken, A., Kozen, D., Vardi, M., and Wimmers, E. (1993), The complexity of set constraints, in "Proceedings of the 1993 Conference on Computer Science Logic (CSL'93)" (E. Börger, Y. Gurevich, and K. Meinke, Eds.), pp. 1-17, Springer-Verlag, Heidelberg.
2. Aiken, A., Kozen, D., and Wimmers, E. (1993), Decidability of systems of set constraints with negative constraints, Inform. and Comput. 122, 30-44. Also Cornell University Technical Report 93-1362, June, 1993.
3. Aiken, A., Wimmers, E., and Lakshman, T. (1994), Soft typing with conditional types, in "Proceedings, ACM Symposium on Principles of Programming Languges," pp. 163-173, Assoc. Comput. Mach. New York.
4. Brachman, R., and Schmolze, J. (1985), An overview of the KL-one knowledge representation system, Comput. Intelligence 9, 171-216.
5. Calvanese, D., Lenzerini, M., and Nardi, D. (1994), A unified framework for class-based representation formalisms, in "Proceedings, Fourth International Conference on Principles of Knowledge Representation and Reasoning," pp. 109-119.
6. Charatonik, W., and Pacholski, L. (1994), Negative set constraints with equality, in "Proceedings, Ninth Annual Symposium on Logic in Computer Science," pp. 128-136, IEEE Comput. Soc. Press, Los Alamitos, CA.
7. Charatonik, W., and Pacholski, L. (1994), Set constraints with projections are in NEXPTIME, in "Proceedings, 35th Annual Symposium on Foundations of Computer Science," pp. 642-653, IEEE Press, New York.
8. Downing, W., and Gallier, J. (1984), Linear time algorithms for testing the satisfiability of propositional Horn formulae, J, Logic Programming 1, 267-284.
9. Emerson, E., and Jutla, C. (1988), The complexity of tree automata and modal logics of programs (extended abstract), in "Proceedings, 29th Annual Symposium on Foundations of Computer Science," pp. 328-337, IEEE Press, New York.
10. Emerson, E., and Jutla, C. (1991), Tree automata, μ-calculus, and determinancy, in "Proceedings, 32nd Annual Symposium on Foundations of Computer Science," pp. 368-377, IEEE Press, New York.
11. Fischer, M., and Ladner, R. (1979), Propositional dynamic logic of regular programs, J. Comput. System Sci. 18, 194-211.
12. Bachmair, L., Ganzinger, H., and Waldmann, U. (1993), Set constraints are the monadic class, in "Proceedings, Eighth Annual IEEE Symposium on Logic in Computer Science," pp. 75-83, IEEE Comput. Soc. Press, Los Alamitos, CA.
13. Giacomo, G., and Lenzerini, M: (1994), Boosting the correspondence between description logics and propositional dynamic logics, in "Proceedings, 12th National Conference on Artificial Intelligence," pp. 205-212, AAAI Press, Menlo Park, CA.
14. Giacomo, G., and Lenzerini, M. (1994), Concept languages with number restrictions and fixed points and its relationship with μ-calculus, in "Proceedings, 11th European Conference on Artificial Intelligence," pp. 356-360.
15. Given, R., and McAllester, D. (1992), New results on local inference relations, in "proceedings, Principles of Knowledge Representation and Reasoning: the Third International Conference," pp. 403-412, Morgan Kaufman, San Mateo, CA. Also available at http://www.ece.purdue.edu/̃givan/kr92.ps.
16. Goldblatt, R. (1989), Varieties of complex algebras, Ann. Pure Appl. Logic 44, 173-242.
17. Heintze, N., and Jaffar, J. (1990), A finite presentation theorem for approximating logic programs, in "Proceedings, Seventeenth Annual ACM Symposium on Principles of Programming Languages," pp. 197-209.
18. Heintze, N., and Jaffar, J. (1990), A decision procedure for a class of set constraints, in "Proceedings, Fifth Annual IEEE Symposium on Logic in Computer Science," pp. 42-51, IEEE Comput. Soc. Press, Los Alamitos, CA.
19. Jònnson, B., and Tarski, A. (1951), Boolean algebras with operators, part i, Amer. J. Math. 73, 891-939.
20. Jònnson, B., and Tarski, A. (1952), Boolean algebras with operators, part ii, Amer. J. Math. 74, 127-167.
21. Kozen, D. (1983), Results on the propositional μ-calculus, Theoret. Comput. Sci. 27, 333-354.
22. Kozen, D. (1993), Logical aspects of set constraints, in "Proceedings, 1993 Conference on Computer Science Logic," European Association for Computer Science Logic.
23. Kozen, D., Palsberg, J., and Schwartzbach, M. (1993), Efficient recursive subtyping, in "Proceedings, Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages," pp. 419-428.
24. Kozen, D., Palsberg, J., and Schwartzbach, M. (1994), Efficient inference of partial types, J. Comput. System Sci. 49, 306-324.
25. Lewis, H. (1980), Complexity results for classes of quantificational formulas, J. Comput. System Sci. 21, 317-353.
26. McAllester, D., and Givan, R. (1992), Natural language syntax and first order inference, Artificial Intelligence 56, 1-20. Also available at http://www.ece.purdue.edu/̃givan/papers/aij1.ps.
27. McAllester, D., and Given, R. (1993), Taxonomic syntax for first order inference, J. Assoc. Comput. Mach. 40, 246-283. Also available at http://www.ece.purdue.edu/̃givan/papers/jacm1.ps.
28. Donini, F., Lenzerini, M., Nardi, D., and Nutt, W. (1991), The complexity of concept languages, in "Proceedings, Principles of Knowledge Representation and Reasoning: the Second International Conference," pp. 151-162, Morgan Kaufmann, San Mateo, CA.
29. Pratt, V. (1980), A near-optimal method for reasoning about actions, J. Comput. System Sci. 20, 231-254.
30. Safra, S. (1988), On the complexity of ω-automata, in "Proceedings, 29th Annual Symposium on Foundations of Computer Science," pp. 319-327, IEEE Press, New York.
31. Schmidt-Schauss, M., and Smalka, G. (1991), Attributive concept descriptions with complements, Artificial Intelligence 47, 1-26.
32. Streett, R., and Emerson, E. (1989), An automaton theoretic decision procedure for the propositional μ-calculus, Inform. and Comput. 81, 249-264.
33. Frühwirth, T., Shapiro, E., Verdi, M., and Yardeni, E. (1991), Logic programs as types for logic programs, in "Proceedings, Sixth Annual IEEE Symposium on Logic in Computer Science," pp. 300-309, IEEE Comput. Soc. Press, Los Alamitos, CA.