2006 |
85 | Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi Junttila, Silvio Ranise, Peter van Rossum, and Roberto Sebastiani. Efficient theory combination via boolean search. Information and Computation, 204(10):1493–1525, October 2006. |
|
84 | Tomi Janhunen, Ilkka Niemelä, Dietmar Seipel, Patrik Simons, and Jia-Huai You. Unfolding partiality and disjunctions in stable model semantics. ACM Transactions on Computational Logic, 7(1):1–37, January 2006. |
|
2005 |
83 | Misa Keinänen. Solving boolean equation systems. Research Report A99, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, November 2005. |
|
82 | Toni Jussila. On bounded model checking of asynchronous systems. Research Report A97, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, October 2005. Doctoral dissertation. |
|
81 | Jan Friso Groote and Misa Keinänen. A sub-quadratic algorithm for conjunctive and disjunctive boolean equation systems. In D.V. Hung and M. Wirsing, editors, Theoretical Aspects of Computing – ICTAC 2005, volume 3722 of Lecture Notes in Computer Science, pages 545–558. Springer-Verlag, October 2005. |
|
80 | Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi Junttila, Peter van Rossum, Stephan Schulz, and Roberto Sebastiani. MathSAT: Tight integration of SAT and mathematical decision procedures. Journal of Automated Reasoning, 35(1–3):265–293, October 2005. |
|
79 | Timo Latvala. Automata-theoretic and bounded model checking for linear temporal logic. Research Report A95, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, August 2005. Doctoral dissertation. |
|
78 | Misa Keinänen. Obtaining memory efficient solutions to boolean equation systems. In Electronic Notes in Theoretical Computer Science, volume 133, pages 175–191. Elsevier, May 2005. |
|
77 | Misa Keinänen. Solving Boolean Equation Systems. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2005. |
|
76 | Misa Keinänen and Ilkka Niemelä. Solving alternating boolean equation systems in answer set programming. In U. Geske D. Seipel, M. Hanus and O. Bartenstein, editors, Applications of Declarative Programming and Knowledge Management, volume 3392 of Lecture Notes in Computer Science, pages 134–148. Springer-Verlag, 2005. |
|
75 | Emilia Oikarinen. CIRC2DLP 1.1 — software for translating parallel circumscription to disjunctive logic programming, 2005. Computer Program. |
|
74 | Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä. Unrestricted vs restricted cut in a tableau method for Boolean circuits. Annals of Mathematics and Artificial Intelligence, 44(4):373–399, 2005. |
|
73 | Jussi Rintanen, Keijo Heljanko, and Ilkka Niemelä. Planning as satisfiability: Parallel plans and algorithms for plan search. Technical Report 216, Institute of Computer Science, University of Freiburg, Freiburg, Germany, 2005. |
|
72 | Timo Latvala, Armin Biere, Keijo Heljanko, and Tommi Junttila. Simple is better: Efficient bounded model checking for past LTL. In Radhia Cousot, editor, Verification, Model Checking and Abstract Interpretation 2005, 6th International Conference VMCAI'05, Paris, France, volume 3385 of Lecture Notes in Computer Science, pages 380–395. Springer, January 2005. |
|
71 | Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi Junttila, Peter van Rossum, Stephan Schulz, and Roberto Sebastiani. An incremental and layered procedure for the satisfiability of linear arithmetic logic. In Nicolas Halbwachs and Lenore D. Zuck, editors, Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2005), volume 3440 of Lecture Notes in Computer Science, pages 317–333. Springer, 2005. |
|
70 | Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi Junttila, Peter van Rossum, Stephan Schulz, and Roberto Sebastiani. MathSAT: Tight integration of SAT and mathematical decision procedures. In Enrico Giunchiglia and Toby Walsh, editors, SAT 2005; Satisfiability Research in the Year 2005, pages 265–293. Springer, 2005. Reprint of the same article in the number 1-3 of volume 25 of the Journal of Automated Reasoning, 2005. |
|
69 | Toni Jussila, Keijo Heljanko, and Ilkka Niemelä. BMC via on-the-fly determinization. International Journal on Software Tools for Technology Transfer, 7(2):89 – 101, 2005. |
|
2004 |
68 | Timo Latvala, Armin Biere, Keijo Heljanko, and Tommi Junttila. Simple bounded LTL model checking. In Alan J. Hu and Andrew K. Martin, editors, Formal Methods in Computer-Aided Design 2004, 5th International Conference FMCAD'04, Austin, Texas, USA, volume 3312 of Lecture Notes in Computer Science, pages 186–200. Springer, nov 2004. |
|
67 | Keijo Heljanko and Alin Ştefănescu. Complexity results for checking distributed implementability. Technical Report 05/2004, Institute of Formal Methods in Computer Science, University of Stuttgart, Stuttgart, Germany, October 2004. |
|
66 | Misa Keinänen. Obtaining memory efficient solutions to boolean equation systems. In J. Bicarregui A. Butterfield and A. Arenas, editors, Proceedings of the 9th International Workshop on Formal Methods for Industrial Critical Systems (FMICS 2004), number SEA-SR-03 in Technical Report, pages 191–208, Linz, Austria, September 2004. Institute for systems Engineering & Automation, Kepler University Linz. |
|
65 | Jussi Rintanen, Keijo Heljanko, and Ilkka Niemelä. Parallel encodings of classical planning as satisfiability. In José Júlio Alferes and João Alexandre Leite, editors, Proceedings of the 9th European Conference on Logics in Artificial Intelligence (JELIA'04), volume 3229 of Lecture Notes in Computer Science, pages 307–319, Lisbon, Portugal, September 2004. Springer-Verlag. |
|
64 | Tommi Syrjänen. Cardinality constraint programs. In Jose Julio Alferes and Joao Leite, editors, The 9th European Conference on Logics in Artificial Intelligence (JELIA'04), pages 187–200. Springer-Verlag, September 2004. |
|
63 | Tomi Janhunen and Emilia Oikarinen. Capturing parallel circumscription with disjunctive logic programs. In José Júlio Alferes and Jo ao Leite, editors, Proceedings of the 9th European Conference on Logics in Artificial Intelligence, JELIA'04, pages 134–146, Lisbon, Portugal, September 2004. Springer-Verlag. LNAI 3229. |
|
62 | Tuomo Pyhälä. Specification-based test selection in formal conformance testing. Research Report A93, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, August 2004. |
|
61 | Tomi Janhunen. Representing normal programs with clauses. In Ramon López de Mántaras and Lorenza Saitta, editors, Proceedings of the 16th European Conference on Artificial Intelligence, pages 358–362, Valencia, Spain, August 2004. IOS Press. |
|
60 | Timo Latvala, Armin Biere, Keijo Heljanko, and Tommi Junttila. Simple bounded LTL model checking. Research Report A92, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, July 2004. |
|
59 | Jan Friso Groote and Misa Keinänen. A sub-quadratic algorithm for conjunctive and disjunctive bess. CS-Report 04-13, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, Netherlands, June 2004. |
|
58 | Toni Jussila. BMC via dynamic atomicity analysis. In Proceedings of the International Conference on Application of Concurrency to System Design (ACSD'2004), Hamilton, Ontario, Canada, June 2004. |
|
57 | Jan Friso Groote and Misa Keinänen. Solving disjunctive/conjunctive boolean equation systems with alternating fixed points. In K. Jensen and A. Podelski, editors, Proceedings of the 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'2004), volume 2988 of Lecture Notes in Computer Science, pages 436–450, Barcelona, Spain, April 2004. Springer. |
|
56 | Misa Keinänen and Ilkka Niemelä. Solving alternating boolean equation systems in answer set programming. In U. Geske D. Seipel, M. Hanus and O. Bartenstein, editors, Proceedings of the 15th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2004), volume 327 of Technical Report, pages 255–264, Potsdam, Germany, April 2004. Bayerische Julius-Maximilians-Universität Würzburg, Institut für Informatik. |
|
55 | Matti Järvisalo. Proof complexity of cut-based tableaux for Boolean circuit satisfiability checking. Research Report A90, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, March 2004. |
|
54 | Matti Järvisalo. Proof complexity of cut-based tableaux for Boolean circuit satisfiability checking. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2004. |
|
53 | Tuomo Pyhälä. genfacbm — a benchmark generator based on factoring for SAT and ASP solvers, 2004. Computer program. |
|
52 | Emilia Oikarinen and Tomi Janhunen. Verifying the equivalence of logic programs in the disjunctive case. In V. Lifschitz and I. Niemelä, editors, Logic Programming and Nonmonotonic Reasoning, Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning, volume 2923 of Lecture Notes in Artificial Intelligence, pages 180–193, Fort Lauderdale, USA, January 2004. Springer-Verlag. |
|
51 | Victor Marek, Ilkka Niemelä, and Mirosław Truszczyński. Programs with monotone cardinality atoms. In Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 154–166. Springer-Verlag, 2004. |
|
50 | Vladimir Lifschitz and Ilkka Niemelä, editors. Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Artificial Intelligence 2923. Springer-Verlag, 2004. |
|
49 | Jussi Rintanen, Keijo Heljanko, and Ilkka Niemelä. Parallel encodings of classical planning as satisfiability. Technical Report 198, Institute of Computer Science at Freiburg University, 2004. |
|
48 | Gerhard Brewka, Ilkka Niemelä, and Tommi Syrjänen. Logic programs with ordered disjunction. Computational Intelligence, 20(2):333–357, 2004. |
|
47 | Matti Järvisalo. Lauselogiikan toteutuvuustarkastus: käytännönläheistä teoriaa. Tietojenkäsittelytiede, 22:47–63, 2004. In Finnish. |
|
46 | Matti Järvisalo and Ilkka Niemelä. A compact reformulation of propositional satisfiability as binary constraint satisfaction. In Alan M. Frisch and Ian Miguel, editors, Proceedings of the 3rd International Workshop on Modelling and Reformulating Constraint Satisfaction Problems: Towards Systemisation and Automation, pages 111–124, 2004. Proceedings available at http://www-users.cs.york.ac.uk/%7Efrisch/Reformulation/04/. |
|
45 | Matti Järvisalo. Todistuskompleksisuudesta Boolen piirien toteutuvuustarkastuksessa. In Pasi Fränti and Esko Marjomaa, editors, Tietojenkäsittelytieteen päivät 2004, volume 5 of International Proceedings Series of Department of Computer Science, University of Joensuu, pages 49–53. Joensuun yliopisto, 2004. In Finnish. |
|
44 | Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä. Unrestricted vs restricted cut in a tableau method for Boolean circuits. In 8th International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, Florida, USA, January 4–6, 2004. Proceedings available at http://rutcor.rutgers.edu/%7Eamai/aimath04/. |
|
43 | Timo Latvala and Heikki Tauriainen. Improved on-the-fly verification with testers. Nordic Journal of Computing, 11(2):148–164, 2004. |
|
42 | Timo Latvala and Marko Mäkelä. LTL model checking for modular Petri nets. In J. Cortadella and W. Reisig, editors, Application and Theory of Petri Nets 2004. 25th International Conference, ICATPN 2004., volume 3099 of LNCS, pages 298–311, 2004. |
|
41 | Tommi A. Junttila. New canonical representative marking algorithms for place/transition-nets. In J. Cortadella and W. Reisig, editors, Application and Theory of Petri Nets 2004, volume 3099 of Lecture Notes in Computer Science, pages 258–277. Springer, 2004. |
|
40 | Tommi A. Junttila. New orbit algorithms for data symmetries. In Application of Concurrency to System Design 2004, pages 175–184. IEEE, 2004. |
|
39 | Tomi Janhunen and Ilkka Niemelä. GnT – a solver for disjunctive logic programs. In Vladimir Lifschitz and Ilkka Niemelä, editors, Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 331–335, Fort Lauderdale, Florida, 2004. Springer-Verlag. LNAI 2923. |
|
38 | Tomi Janhunen and Emilia Oikarinen. lpeq and dlpeq – translators for automated equivalence testing of logic programs. In Vladimir Lifschitz and Ilkka Niemelä, editors, Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 336–340, Fort Lauderdale, Florida, 2004. Springer-Verlag. LNAI 2923. |
|
37 | Tomi Janhunen and Patrik Simons. GnT 2.1 — A tool for computing stable models for disjunctive logic programs. http://www.tcs.hut.fi/Software/gnt/, 2004. Computer Program. |
|
2003 |
36 | Heikki Tauriainen. On translating linear temporal logic into alternating and nondeterministic automata. Research Report A83, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2003. |
|
35 | Emilia Oikarinen. Testing the equivalence of disjunctive logic programs. Research Report A85, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2003. |
|
34 | Tommi Syrjänen. Logic programming with cardinality constraints. Research Report A86, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2003. |
|
33 | Jan Friso Groote and Misa Keinänen. Solving disjunctive/conjunctive boolean equation systems with alternating fixed points. Technical Report SEN-R0310, Stichting Centrum voor Wiskunde en Informatica (CWI), Amsterdam, Amsterdam, Netherlands, December 2003. |
|
32 | Tomi Janhunen. Translatability and intranslatability results for certain classes of logic programs. Research Report A82, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, November 2003. |
|
31 | Ilkka Niemelä. Answer set programming: an approach to declarative problem solving. In Proceedings of the Eighth Scandinavian Conference on Artificial Intelligence, pages 189–191, Bergen, Norway, November 2003. IOS Press. Extended abstract of a key note talk. |
|
30 | Toni Jussila. Daa - a BMC tool translating LTSs to boolean circuits, October 2003. http://www.tcs.hut.fi/ tjussila/daa. |
|
29 | Tommi Junttila. On the symmetry reduction method for Petri nets and similar formalisms. Research Report A80, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, September 2003. Doctoral dissertation. |
|
28 | Tomi Janhunen. A counter-based approach to translating normal logic programs into sets of clauses. In Marina de Vos and Alessandro Provetti, editors, Answer Set Programming: Advances in Theory and Implementation, pages 166–180, Messina, Sicily, September 2003. CEUR. http://ceur-ws.org/Vol-78/. |
|
27 | Gerd Brewka, Ilkka Niemelä, and Mirosław Truszczyński. Answer set optimization. In Proceedings of the 18th International Joint Conference on Artificial Intelligence, pages 867–872. Morgan Kaufmann Publishers, August 2003. |
|
26 | Heikki Tauriainen. Nested emptiness search for generalized Büchi automata. Research Report A79, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, July 2003. |
|
25 | Ilkka Niemelä. Answer set programming: From model computation to problem solving. In Proceedings of CADE-19 Workshop on Model Computation — Principles, Algorithms, Applications, Miami, Florida, USA, July 2003. Extended abstract of an invited talk. |
|
24 | Toni Jussila, Keijo Heljanko, and Ilkka Niemelä. BMC via on-the-fly determinization. In Proceedings of the 1st International Workshop on Bounded Model Checking, volume 89 of ENTCS, Boulder, CO, USA, July 2003. |
|
23 | Tuomo Pyhälä and Keijo Heljanko. Specification coverage aided test selection. In Johan Lilius, Felice Balarin, and Ricardo J. Machado, editors, Proceeding of the 3rd International Conference on Application of Concurrency to System Design (ACSD'2003), pages 187–195, Guimaraes, Portugal, June 2003. IEEE Computer Society. |
|
22 | Emilia Oikarinen. Logiikkaohjelmien ekvivalenssitestaus. In Ari Korhonen and Jorma Tarhio, editors, Tietojenkäsittelytieteen päivät 2003, pages 44–47, Espoo, Finland, May 2003. Yliopistopaino. In Finnish. |
|
21 | Toni Jussila. Otf - a BMC tool translating LTSs to boolean circuits, May 2003. |
|
20 | Tomi Janhunen. Evaluating the effect of semi-normality on the expressiveness of defaults. Artificial Intelligence, 144(1–2):233–250, March 2003. |
|
19 | Heikki Tauriainen. On translating linear temporal logic into alternating and nondeterministic automata. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2003. |
|
18 | Tommi Syrjänen. Logic programming with cardinality constraints. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2003. |
|
17 | Tuomo Pyhälä. Specification-based test selection in formal conformance testing. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2003. |
|
16 | Emilia Oikarinen. Testing the equivalence of disjunctive logic programs. Master's thesis, Helsinki University of Technology, Department of Engineering Physics and Mathematics, 2003. |
|
15 | Emilia Oikarinen. DLPEQ 1.9 — a tool for testing the equivalence of disjunctive logic programs, 2003. Computer Program. |
|
14 | Juha Tiihonen, Timo Soininen, Ilkka Niemelä, and Reijo Sulonen. A practical tool for mass-customising configurable products. In Proceedings of the 14th International Conference on Engineering Design, pages 1290–1299, 2003. |
|
13 | Tuomo Pyhälä and Keijo Heljanko. Bomotest: A formal conformance testing tool, version 1.5. Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, 2003. Software. |
|
12 | Keijo Heljanko and Ilkka Niemelä. Bounded LTL model checking with stable models. Theory and Practice of Logic Programming, 3(4&5):519–550, 2003. Also available as (CoRR: arXiv:cs.LO/0305040). |
|
11 | Tomi Janhunen and Patrik Simons. GnT 2 — A tool for computing stable models for disjunctive logic programs. http://www.tcs.hut.fi/Software/gnt/, 2003. Computer Program. |
|
10 | Tomi Janhunen, Ilkka Niemelä, Dietmar Seipel, Patrik Simons, and Jia-Huai You. Unfolding partiality and disjunctions in stable model semantics. http://arxiv.org/abs/cs.AI/0303009, 2003. To appear in ACM Transactions on Computational Logic. |
|
2002 |
9 | Tommi Junttila. New canonical representative marking algorithms for place/transition-nets. Research Report A75, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, October 2002. |
|
8 | Gerd Brewka, Ilkka Niemelä, and Tommi Syrjänen. Implementing ordered disjunction using answer set solvers for normal programs. In Proceedings of the 8th European Conference on Logics in Artificial Intelligence (JELIA'02), pages 444–455, Cosenza, Italy, September 2002. Springer-Verlag. |
|
7 | Tomi Janhunen and Emilia Oikarinen. Testing the equivalence of logic programs under stable model semantics. In Sergio Flesca et al., editors, Logics in Artificial Intelligence, Proceedings of the 8th European Conference, pages 493–504, Cosenza, Italy, September 2002. Springer-Verlag. LNAI 2424. |
|
6 | Toni Jussila. Bounded model checking for verifying concurrent programs. Research Report A73, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, August 2002. |
|
5 | Toni Jussila and Ilkka Niemelä. Parallel program verification using BMC. In Proceedings of the ECAI 2002 Workshop on Model Checking and Artificial Intelligence, pages 59–66, Lyon, France, July 2002. |
|
4 | Keijo Heljanko, Victor Khomenko, and Maciej Koutny. Parallelisation of the Petri net unfolding algorithm. In Joost-Pieter Katoen and Perdita Stevens, editors, Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'2002), volume 2280 of Lecture Notes in Computer Science, pages 371–385, Grenoble, France, April 2002. Springer-Verlag. |
|
3 | Patrik Simons, Ilkka Niemelä, and Timo Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138(1–2):181–234, 2002. |
|
2 | Juha Tiihonen, Timo Soininen, Ilkka Niemelä, and Reijo Sulonen. Empirical testing of a weight constraint rule based configurator. In ECAI 2002 Configuration Workshop, pages 17–22, 2002. |
|
1 | Tomi Janhunen. lpeq 1.13 — A tool for testing the equivalence of logic programs. http://www.tcs.hut.fi/Software/lpeq/, 2002. Computer Program. |
|