TCS / Research / Publications / 1996
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

Publications in 1996

32Jussi Rintanen. Lexicographic ordering as a basis of priorities in default reasoning. Research Report A41, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, December 1996. Doctoral dissertation.
PostScript (1 MB)
GZipped PostScript (460 kB)
Info
31Tino Pyssysalo, Leo Ojala, and Olli-Matti Penttinen. Performance analysis of a video on demand systems using stochastic Petri nets, a case study. Research Report A40, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, November 1996.
Info
30P. Baumgartner, U. Furbach, and Ilkka Niemelä. Hyper tableaux. In José Júlio Alferes, Luís Moniz Pereira, and Ewa Orlowska, editors, Proceedings of the European Workshop on Logics in Artificial Intelligence (JELIA'96), pages 1–17, Èvora, Portugal, September/October 1996. Springer-Verlag.
Info
29Ilkka Niemelä and P. Simons. Efficient implementation of the well-founded and stable model semantics. In M. Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 289–303, Bonn, Germany, September 1996. The MIT Press.
Info
28C. Aravindan, P. Baumgartner, J. Dix, U. Furbach, G. Neugebauer, Ilkka Niemelä, D. Schäfer, and F. Stolzenburg. On merging theorem proving and logic programming paradigms. In M. Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, page 546, Bonn, Germany, September 1996. The MIT Press.
Info
27C. Aravindan, P. Baumgartner, J. Dix, U. Furbach, G. Neugebauer, Ilkka Niemelä, D. Schäfer, and F. Stolzenburg. On merging theorem proving and logic programming paradigms. In N.E. Fuchs and U. Geske, editors, Proceedings of the Poster Session at JICSLP'96, pages 99–122, Bonn, Germany, September 1996. GMD—Forschungszentrum Informationstechnik. GMD-Studien Nr. 296.
Info
26Keijo Heljanko. Implementing a CTL model checker. In L. Czaja, P. Starke, H.-D. Burkhard, and M. Lenz, editors, Proceedings of the Workshop Concurrency, Specification & Programming 1996, Informatik-Bericht Nr. 69, pages 75–84, Berlin, Germany, September 1996. Humboldt-University, Berlin.
Info
See www.tcs.hut.fi ...
25Tuomas Aura. Time processes of time Petri nets. Research Report A38, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, August 1996.
NOTE: Reprint of Master's thesis; see URL below.
PostScript (531 kB)
GZipped PostScript (175 kB)
Info
See www.tcs.hut.fi ...
24Karsten Schmidt. How to calculate symbolically siphons and traps for some algebraic Petri nets. Research Report A39, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, August 1996.
PostScript (391 kB)
GZipped PostScript (129 kB)
Info
23Johan Lilius, editor. Annual report for the year 1995. Technical report, Teknillinen korkeakoulu, Tietojenkäsittelyteorian laboratorio (Helsinki University of Technology, Laboratory for Theoretical Computer Science), Espoo, Finland, August 1996.
PostScript (123 kB)
GZipped PostScript (48 kB)
Info
22Ilkka Niemelä. Implementing circumscription using a tableau method. In Proceedings of the European Conference on Artificial Intelligence, pages 80–84, Budapest, Hungary, August 1996. John Wiley.
Info
21Ilkka Niemelä, editor. Proceedings of the ECAI'96 Workshop on Integrating Nonmonotonicity into Automated Reasoning Systems, Budapest, Hungary, August 1996. Universität Koblenz-Landau, Fachbericht Informatik 18–96. Available at http://www.uni-koblenz.de/fb4/publikationen/gelbereihe/.
Info
20Tomi Janhunen. Representing autoepistemic introspection in terms of default rules. In Wolfgang Wahlster, editor, Proceedings of the 12th European Conference on Artificial Intelligence, ECAI'96, pages 70–74, Budapest, Hungary, August 1996. John Wiley & Sons.
Info
See www.tcs.hut.fi ...
19Tomi Janhunen. On abstracting decision procedures for non-monotonic reasoning. In Ilkka Niemelä, editor, Proceedings of the ECAI'96 Workshop on Integrating Nonmonotonicity into Automated Reasoning Systems, pages 29–31, August 1996. Universität Koblenz-Landau, Institut für Informatik, Fachberichte Informatik, 18–96.
Info
18Ilkka Niemelä. A tableau calculus for minimal model reasoning. In Proceedings of the Fifth Workshop on Theorem Proving with Analytic Tableaux and Related Methods, pages 278–294, Terrasini, Italy, May 1996. Springer-Verlag.
Info
17Tino Pyssysalo. An induction theorem for ring protocols of processes described with predicate/transition nets. Research Report A37, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, April 1996.
NOTE: Reprint of Licentiate's thesis; see URL below.
PostScript (1 MB)
GZipped PostScript (310 kB)
Info
See www.tcs.hut.fi ...
16Eero Lassila. ReFlEx — an experimental tool for special-purpose processor code generation. Technical Report B15, Helsinki University of Technology, Digital Systems Labora tory, Espoo, Finland, March 1996.
PostScript (893 kB)
GZipped PostScript (186 kB)
Info
15Tino Pyssysalo. An Induction Theorem for Ring Protocols of Processes Describes Using Predicate/Transition Nets. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1996.
Info
See www.tcs.hut.fi ...
14Tuomas Aura. Time processes of time petri nets. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1996.
Info
See www.tcs.hut.fi ...
13Jukka Helme. Yhteyspohjaisten tietoliikenneprotokollien mallintamisesta ja analysoinnista. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 1996.
Info
12Asko Nykänen. Suomenkielen lauseenjäsennysympäristön suunnittelu ja toteutus. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 1996.
Info
11Mervi Salmi-Saarinen. A study of wireless communication. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 1996.
Info
10Kimmo Varpaaniemi. Finding small stubborn sets automatically. In Volkan Atalay, Uğur Halıcı, Kemal İnan, Neşe Yalabık, and Adnan Yazıcı, editors, Proceedings of the Eleventh International Symposium on Computer and Information Sciences, ISCIS XI, November 6–8, 1996, Antalya, Turkey, Volume I, pages 133–142. Middle East Technical University, Ankara, Turkey, 1996.
Info
9Eero Lassila. A macro expansion approach to embedded processor code generation. In Proceedings of the 22nd Euromicro Conference, pages 136–142. IEEE Computer Society Press, 1996.
Info
8Ilkka Niemelä. A tableau calculus for minimal model reasoning. Fachbericht Informatik 5–96, Universität Koblenz-Landau, 1996. Available at http://www.uni-koblenz.de/fb4/publikationen/gelbereihe/.
Info
7Ilkka Niemelä. Implementing circumscription using a tableau method. Fachbericht Informatik 6–96, Universität Koblenz-Landau, 1996. Available at http://www.uni-koblenz.de/fb4/publikationen/gelbereihe/.
Info
6Ilkka Niemelä and P. Simons. Efficient implementation of the well-founded and stable model semantics. Fachbericht Informatik 7–96, Universität Koblenz-Landau, 1996. Available at http://www.uni-koblenz.de/fb4/publikationen/gelbereihe/.
Info
5P. Baumgartner, U. Furbach, and Ilkka Niemelä. Hyper tableaux. Fachbericht Informatik 8–96, Universität Koblenz-Landau, 1996. Available at http://www.uni-koblenz.de/fb4/publikationen/gelbereihe/.
Info
4Ilkka Niemelä. Autoepistemic logic as a basis for automating nonmonotonic reasoning. In Patrick Doherty, editor, Partiality, Modality and Non-monotonicity, pages 251–289. CSLI Publications, Stanford, CA, 1996.
Info
3S. Brass, J. Dix, Ilkka Niemelä, and T.C. Przymusinski. A comparison of STATIC semantics with D-WFS. Fachbericht Informatik 2–96, Universität Koblenz-Landau, 1996. Available at http://www.uni-koblenz.de/fb4/publikationen/gelbereihe/.
Info
2Ilkka Niemelä (Ed.). Proceedings of the ECAI'96 Workshop on Integrating Nonmonotonicity into Automated Reasoning Systems. Fachbericht Informatik 18–96, Universität Koblenz-Landau, 1996. Available at http://www.uni-koblenz.de/fb4/publikationen/gelbereihe/.
Info
1Kaisa Nyberg and Rainer A. Rueppel. Message recovery for signature schemes based on the discrete logarithm problem. Designs, Codes and Cryptography, 7(1–2):61–81, 1996.
Info

[TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links]
Latest update: 19 January 2010.