Home

1. The determinant of the boolean formulae, [Andrei, 1995]
2. Weak Equivalence in Propositional Calculus, [Andrei, 1999]
3. Incremental satisfiability counting for real-time systems, [Andrei, Chin, 2003]
4. Counting for satisfiability by inverting resolution, [Andrei, 2004]
5. Incremental satisfiability counting for real-time systems, [Andrei, Chin, 2004]
6. Systematic Debugging of Real-Rime Systems based on Incremental Satisfiability Counting, [Andrei, Chin, Cheng, Lupu, 2005]

1. S. Andrei, “The determinant of the boolean formulae,” Analele Universitatii Bucuresti, Informatica, vol. XLIV, pp. 83–92, 1995.



2. S. Andrei, "Weak Equivalence in Propositional Calculus" Proceedings of European Summer School on Logic, Language and Information (ESSLLI’99), The Netherlands, August 9-20, pp.79-89, 1999



3. S. Andrei and W.-N. Chin, “Incremental satisfiability counting for real-time systems,” Faculty of Computer Science, Iasi University, Romania, Technical Report TR03-04, Sept. 2003. ISSN 1224-9327



4. S. Andrei and W.-N. Chin, “Incremental satisfiability counting for real-time systems,” in Proceedings of 10th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'04), Toronto, Canada, May 25-28, 2004.



5. S. Andrei, “Counting for satisfiability by inverting resolution,” Artificial Intelligence Review, 2004.



6. S. Andrei, W.-N. Chin, A. M. K. Cheng, and M. Lupu, “Systematic Debugging of Real-Rime Systems based on Incremental Satisfiability Counting,” Proceedings of the 11th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'05), March 7 - 10, 2005, San Francisco, California