|
27 | Tommi Syrjänen. A rule-based formal model for software configuration. Research Report A55, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 1999. |
|
|
26 | Keijo Heljanko. Deadlock and reachability checking with finite complete prefixes. Research Report A56, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, December 1999. |
|
|
25 | Tommi Junttila. Detecting and exploiting data type symmetries of algebraic system nets during reachability analysis. Research Report A57, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, December 1999. |
|
|
24 | Ilkka Niemelä, Patrik Simons, and Timo Soininen. Stable model semantics of weight constraint rules. In Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 317–331, El Paso, Texas, USA, December 1999. Springer-Verlag. |
|
|
23 | Tomi Janhunen. Classifying semi-normal default logic on the basis of its expressive power. In Michael Gelfond, Nicola Leone, and Gerald Pfeifer, editors, Proceedings of the 5th International Conference on Logic Programming and Non-Monotonic Reasoning, LPNMR'99, pages 19–33, El Paso, Texas, December 1999. Springer-Verlag. LNAI 1730. |
|
|
22 | Timo Soininen, Esther Gelle, and Ilkka Niemelä. A fixpoint definition of dynamic constraint satisfaction. In Joxan Jaffar, editor, Proceedings of the Fifth International Conference on Principles and Practice of Constraint Programming, pages 419–433, Alexandria, Virginia, USA, October 1999. Springer-Verlag. |
|
|
21 | Keijo Heljanko. Minimizing finite complete prefixes. In H.-D. Burkhard, L. Czaja, H.-S. Nguyen, and P. Starke, editors, Proceedings of the Workshop Concurrency, Specification & Programming 1999, pages 83–95, Warsaw, Poland, September 1999. Warsaw University. |
|
|
20 | Timo Latvala and Keijo Heljanko. Coping with strong fairness – on-the-fly emptiness checking for streett automata. In H.-D. Burkhard, L. Czaja, H-S. Nguyen, and P. Starke, editors, Concurrency, Specification & Programming Workshop, pages 107–118, Warsaw, Poland, September 1999. Institute of Informatics, Warsaw University. |
|
|
19 | Antti Huima. Analysis of cryptographic protocols via symbolic state space enumeration. Research Report A54, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, August 1999. |
|
|
18 | Harriet Beaver and Ilkka Niemelä. Finding MAPs for belief networks using rule-based constraint programming. In Arpakannus 1/99 - Special Issue on Networks'99, Espoo, Finland, Aug 1999. Finnish Articial Intelligence Society. |
|
|
17 | Ilkka Niemelä. On the complexity of dynamic constraint satisfaction. In Proceedings of the FLoC Workshop on Complexity-Theoretic and Recursion-Theoretic Methods in Databases, Artificial Intelligence and Finite Model Theory, pages 38–47, Trento, Italy, July 1999. |
|
|
16 | Antti Huima. Analysis of cryptographic protocols via symbolic state space enumeration. Master's thesis, Helsinki University of Technology, May 1999. [This thesis was nominated the best Master's Thesis on the area of Computer Science by The Finnish Society for Computer Science in 1999.] |
|
|
15 | Tommi A. Junttila. Finding symmetries of algebraic system nets. Fundamenta Informaticae, 37(3):269–289, February 1999. |
|
|
14 | Tommi Junttila. Detecting and Exploiting Data Type Symmetries of Algebraic System Nets during Reachability Analysis. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 1999. |
|
|
13 | Keijo Heljanko. Deadlock and Reachability Checking with Finite Complete Prefixes. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 1999. |
|
|
12 | Antti Huima. Analysis of cryptographic protocols via symbolic state space enumeration. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 1999. |
|
|
11 | Ismo Kangas. Luotettava tiedonsiirto matkaviestimen ja pakettikytkentäisen digitaalisen GSM-matkapuhelinverkon välillä. Master's thesis, Helsinki University of Technology, Department of Electrical and Commucations Engineering, 1999. |
|
|
10 | Janne Palonen. Controlling and monitoring a distributed ISP environment. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 1999. |
|
|
9 | Tommi Syrjänen. A rule-based formal model for software configuration. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 1999. |
|
|
8 | Kimmo Varpaaniemi. Stable models for stubborn sets. In Hans-Dieter Burkhard, Ludwik Czaja, Hung Son Nguyen, and Peter H. Starke, editors, Concurrency, Specification and Programming: Proceedings of the CS&P'99 Workshop, Warsaw, Poland, 28–30 September 1999, pages 263–274. Zakład Graficzny UW, zam. 482/99, Warsaw, Poland, 1999. |
|
|
7 | Timo Soininen and Ilkka Niemelä. Developing a declarative rule language for applications in product configuration. In Proceedings of the First International Workshop on Practical Aspects of Declarative Languages, pages 305–319, San Antonio, Texas, January 1999. Springer-Verlag. |
|
|
6 | Ilkka Niemelä. Logic programming with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3,4):241–273, 1999. |
|
|
5 | Ilkka Niemelä. Automating default reasoning. Lecture notes for a course given at the 11th European Summer School in Logic, Language and Information, Utrecht University, Aug 16–20, 1999. 25 pages., 1999. |
|
|
4 | Keijo Heljanko and Patrik Simons. mcsmodels 1.4: a deadlock and reachability checker using net unfoldings. Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, 1999. Software. |
|
|
3 | Keijo Heljanko. Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri nets. Fundamenta Informaticae, 37(3):247–268, 1999. |
|
|
2 | Keijo Heljanko. Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri nets. In Rance Cleaveland, editor, Proceedings of 5th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'99), volume 1579 of Lecture Notes in Computer Science, pages 240–254, Amsterdam, Netherlands, 1999. Springer-Verlag. |
|
|
1 | Tomi Janhunen. On the intertranslatability of non-monotonic logics. Annals of Mathematics and Artificial Intelligence, 27(1-4):79–128, 1999. Special issue with the selected best papers from JELIA 1998. |
|
