How to encode a logical structure by an OBDD

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1998, Pages 122-131

  Veith, H ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MODEL CHECKING;

HARDNESS RESULT; LOGICAL STRUCTURE; ORDERED BINARY DECISION DIAGRAMS; RELATED WORKS; SYMBOLIC MODEL CHECKING; VARIABLE ORDER;

BINARY DECISION DIAGRAMS;

EID: 85046273452     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.1998.694598     Document Type: Conference Paper

References (37)

1. [ATB94] A. Aziz, S. Tasiran, R. K. Brayton. BDD variable ordering for interacting finite state machines. In Proc. 31st ACM/IEEE Design Automation Conference, 283-288, 1994.
2. [BLT92] J.L. Balcázar, A. Lozano and J. Torán. The Complexity of Algorithmic Problems on Succinct Instances. In R. Baeta-Yates and U. Manber, editors, Computer Science, pp. 351-377, Plenum Press, New York, 1992.
3. [Bal95] J. Balcázar. The Complexity of Searching Implicit Graphs, in Proceedings 22nd International Conference on Automata, Languages, and Programming (ICALP) (1995), Lecture Notes in Computer Science 944 (Springer, Berlin, 1995) 209-219.
4. [BW96] B. Bollig and I. Wegener. Improving the variable ordering of OBDDs is NP-complete. IEEE Transactions on Computers 45:993-1002, 1996.
5. [BL96] B. Borchert and A. Lozano. Succinct Circuit Representations and Leaf Languages are Basically the same Concept, Information Processing Letters 58, 211-215, 1996.
6. [Bry86] R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35:677-691, 1986.
7. [Bry92] R. E. Bryant. Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys 24(3):293-318, 1992.
8. [EGM94] T. Eiter, G. Gottlob and H. Mannila. Adding Disjunction to Datalog. Proceedings ACM PODS-94, May 1994, pp. 267-278. Full Paper Accepted for publication in ACM Transactions on Database Systems.
9. [FKVV98] J. Feigenbaum, S. Kannan, M. Y. Vardi, M. Viswanathan. Complexity of graph problems represented by OBDDs. Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 1373, Springer, Berlin, 1998, pp. 216-226.
10. [GW83] H. Galperin and A. Wigderson. Succinct Representation of Graphs. Information and Control 56 (1983) 183-198.
11. [GLV95] G. Gottlob, N. Leone, and H. Veith. Second order logic and the weak exponential hierarchies. In Proc. Intl. Symp. on Mathematical Foundations of Computer Science, MFCS'95, Prague, CR, LNCS nr. 969, pages 66-81. Springer, August/September 1995.
12. [GLV97] G. Gottlob, N. Leone and H. Veith. Succinctness as a source of complexity in logical formalisms. Technical Report DBAI-TR-97-10, Information Systems Department, TU Vienna, 1997.
13. [CGL96] E.M. Clarke, O. Grumberg, D.E. Long. Model Checking. Springer-Verlag Nato ASI Series F, Volume 152, 1996.
14. [Imm87] N. Immerman. Languages that Capture Complexity Classes. SIAM J. Computation, 16(4):760-778, 1987.
15. [IL95] N. Immerman and S. Landau. The Complexity of Iterated Multiplication, Information and Computation 116, 103-116, 1995
16. [KW88] M. Karpinski and K.W. Wagner, The computational complexity of graph problems with succinct multigraph representation, ZOR 32 (1988) 201-211.
17. [KW92] M. Kowaluk and K.W.Wagner, Vector Language: Simple Descriptions of Hard Instances, in Proc. Mathematical Foundations of Computer Science (MFCS), Springer Lecture Notes in Computer Science 452 (Springer, Berlin, 1990) 378-384.
18. [Len82] T. Lengauer, The complexity of compacting hierarchically specified layouts of integrated circuits, in Proc. IEEE Symposium on 23rd Foundations of Computer Science (FOCS) (1982) 358-368.
19. [LW92] T. Lengauer and K.W. Wagner, The Correlation between the Complexities of the Nonhierarchical and Hierarchical versions of Graph Problems, Journal of Computer and System Sciences 44 (1992) 63-93.
20. [Knu73] D.E. Knuth. The Art of Computer Programming. Volume 3/Sorting and Searching. Addison-Wesley, 1973.
21. [LB89] A.Lozano and J.L.Balcázar. The Complexity of Graph Problems for Succinctly Represented Graphs. In: G.Goos,J.Hartmanis, eds., Graph-Theoretic Concepts in Computer Science, LNCS 411:277-286, Springer-Verlag, 1989.
22. [McM93] K. McMillan. Symbolic Model Checking. Kluwer, 1993.
23. [MS94] Ch. Meinel and A. Slobodová. On the complexity of constructing optimal ordered binary decision diagrams. In Proc. Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science 841, 515-524, 1994.
24. [MT97] Ch. Meinel and T. Theobald. On the inuence of the state encoding on OBDD-representations of finite state machines. In Proc. Mathematical Foundations of Computer Science 1997 (MFCS), Lecture Notes in Computer Science 1295, 408-417, 1997.
25. [Pap94] C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
26. [PY85] C.H. Papadimitriou and M. Yannakakis. A Note on Succinct Representations of Graphs. Information and Computation, 71:181-185, 1985.
27. [Ste91] I.A. Stewart. Complete Problems Involving Boolean Labelled Structures and Projection Transactions, Journal of Logic and Computation 1, 861-882, 1991.
28. [Ste92] I.A. Stewart. Using the Hamiltonian Path Operator to Capture NP. Journal of Computer and System Sciences 45, 127-151, 1992
29. [Ste93a] I.A. Stewart. Methods for proving completeness via logical reductions. Theoretical Computer Science 118, 193-229, 1993.
30. [Ste93b] I.A. Stewart. On Completeness for NP via Projection Translations. Lecture Notes in Computer Science 626, pp.353-366, 1993.
31. [Ste94] I.A. Stewart. Logical Descriptions of Monotone NP Problems. Journal of Logic and Computation 4, 1-21, 1994.
32. [Var82] M. Vardi. Complexity of Relational Query Languages. In Proceedings 14th STOC, pp. 137-146, 1982.
33. [Vei96] H. Veith. Succinct Representation, Leaf Languages and Projection Reductions, in Proc. 11th Annual IEEE Conference on Computational Complexity (CCC) (1996) 118-126. Full paper to appear in Information and Computation.
34. [Vei97a] H.Veith. Languages Represented by Boolean Formulas. Information Processing Letters 63, 251-256, 1997.
35. [Vei97b] H.Veith. How to encode a logical structure as a string. Technical Report DBAI-TR-97-10, Information Systems Department, TU Vienna, 1997.
36. [Wag86] K.W. Wagner. The Complexity of Combinatorial Problems with Succinct Input Representation. Acta Informatica 23, 325-356, 1986.
37. [Weg94] I. Wegener. Efficient data structures for Boolean functions. Discrete Mathematics, 136:347-372, 1994.