Author:
Charatonik Witold,Podelski Andreas
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. A. Aiken. Set constraints: Results, applications and future directions. In Proceedings of the Workshop on Principles and Practice of Constraint Programming, LNCS 874, pages 326–335. Springer-Verlag, 1994.
2. A. Arnold and M. Nivat. Formal computations of non deterministic recursive program schemes. Mathematical Systems Theory, 13:219–236, 1980.
3. A. Arnold and D. Niwinski. Fixed point characterization of weak monadic logic definable sets of trees. In M. Nivat and A. Podelski, editors, Tree Automata and Languages, pages 159–188. North Holland, 1992.
4. L. Bachmair, H. Ganzinger, and U. Waldmann. Set constraints are the monadic class. In Eighth Annual IEEE Symposium on Logic in Computer Science, pages 75–83, 1993.
5. W. Charatonik and L. Pacholski. Set constraints with projections are in NEXPTIME. In Proceedings of the 35th Symposium on Foundations of Computer Science, pages 642–653, 1994.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Deciding inclusion of set constants over infinite non-strict data structures;RAIRO - Theoretical Informatics and Applications;2007-04
2. Demand analysis with partial predicates;Theory and Practice of Logic Programming;2007-01
3. On Language Inequalities XK ⊆ LX;Developments in Language Theory;2005
4. Set Constraints on Regular Terms;Computer Science Logic;2004
5. Atomic Set Constraints with Projection;Rewriting Techniques and Applications;2002