2012 |
|
400 | Tomi Janhunen and Vesa Luukkala. Meta programming with answer sets for smart spaces. In Markus Krötzsch and Umberto Straccia, editors, Proceedings of the 6th International Conference on Web Reasoning and Rule Systems, volume 7497 of Lecture Notes in Computer Science, pages 106–121, Vienna, Austria, September 2012. Springer. |
|
|
399 | Tomi Janhunen and Ilkka Niemelä. Applying visible strong equivalence in answer-set program transformations. In Esra Erdem, Joohyung Lee, Yuliya Lierler, and David Pearce, editors, Correct Reasoning – Essays on Logic-Based AI in Honour of Vladimir Lifschitz, volume 7265 of Lecture Notes in Computer Science, pages 363–379, Rome, Italy, June 2012. Springer. |
|
|
398 | Guohua Liu, Tomi Janhunen, and Ilkka Niemelä. Answer set programming via mixed integer programming. In Principles of Knowledge Representation and Reasoning, pages 32–42, 2012. |
|
|
397 | Jori Dubrovin, Tommi Junttila, and Keijo Heljanko. Exploiting step semantics for efficient bounded model checking of asynchronous systems. Science of Computer Programming, 77(10–11):1095–1121, 2012. |
|
|
396 | Jussi Lahtinen, Janne Valkonen, Kim Björkman, Juho Frits, Ilkka Niemelä, and Keijo Heljanko. Model checking of safety-critical software in the nuclear engineering domain. Reliability Engineering & System Safety (RESS), 105(0):104–113, 2012. |
|
|
395 | Keijo Heljanko, Misa Keinänen, Martin Lange, and Ilkka Niemelä. Solving parity games by a reduction to SAT. Journal of Computer and System Sciences, 78(2):430–440, 2012. |
|
|
394 | Roland Kindermann, Tommi Junttila, and Ilkka Niemelä. Beyond lassos: Complete SMT-based bounded model checking for timed automata. In Holger Giese and Grigore Rosu, editors, Formal Techniques for Distributed Systems, volume 7273 of Lecture Notes in Computer Science, pages 84–100. Springer, 2012. |
|
|
393 | Roland Kindermann, Tommi Junttila, and Ilkka Niemelä. SMT-based induction methods for timed systems. In Marcin Jurdzinski and Dejan Nickovic, editors, Formal Modeling and Analysis of Timed Systems, volume 7595 of Lecture Notes in Computer Science, pages 171–187. Springer, 2012. |
|
|
392 | Tero Laitinen, Tommi Junttila, and Ilkka Niemelä. Extending clause learning sat solvers with complete parity reasoning. In ICTAI 2012 - 24th IEEE International Conference on Tools with Artificial Intelligence. IEEE Computer Society Press, 2012. |
|
|
391 | Tero Laitinen, Tommi Junttila, and Ilkka Niemelä. Classifying and propagating parity constraints. In Michela Milano, editor, Principles and Practice of Constraint Programming - CP 2012, volume 7514 of Lecture Notes in Computer Science, pages 357–372. Springer, 2012. |
|
|
390 | Tero Laitinen, Tommi Junttila, and Ilkka Niemelä. Conflict-driven XOR-clause learning. In Alessandro Cimatti and Roberto Sebastiani, editors, Theory and Applications of Satisfiability Testing - SAT 2012, volume 7317 of Lecture Notes in Computer Science, pages 383–396. Springer, 2012. |
|
2011 |
|
389 | Tuomas Launiainen, Keijo Heljanko, and Tommi Junttila. Efficient model checking of PSL safety properties. IET Computers & Digital Techniques, 5(6):479–492, November 2011. |
|
|
388 | Mai Nguyen, Tomi Janhunen, and Ilkka Niemelä. Translating answer-set programs into bit-vector logic. In Salvador Abreu, Johannes Oetsch, Jörg Pührer, Dietmar Seipel, Hans Tompits, Masanobu Umeda, and Armin Wolf, editors, Proceedings of the 19th International Conference on Applications of Declarative Programming and Knowledge Management, pages 105–116, Vienna, Austria, September 2011. TU Wien, INFSYS Research Report 1843-11-06. |
|
|
387 | Rehan Abdul Aziz, Tomi Janhunen, and Vesa Luukkala. Distributed deadlock handling for resource allocation in smart spaces. In Sergey Balandin, Yevgeni Koucheryavy, and Honglin Hu, editors, Proceedings of 4th Conference on Smart Spaces, volume 6869 of Lecture Notes in Computer Science, pages 87–98, St. Petersburg, Russia, August 2011. Springer. |
|
|
386 | Roland Kindermann, Tommi Junttila, and Ilkka Niemelä. Modeling for Symbolic Analysis of Safety Instrumented Systems with Clocks. In Proceedings of the 11th International Conference on Application of Concurrency to System Designg, ACSD 2011, pages 185–194. IEEE Computer Society, June 2011. |
|
|
385 | Ilkka Niemelä. Answer set programming: A declarative approach to solving challenging search problems. In Proceedings of the 41st IEEE International Symposium on the Multiple-Valued Logic (ISMVL 2011), pages 139–141, Tuusula, Finland, May 2011. IEEE. |
|
|
384 | Tomi Janhunen, Ilkka Niemelä, Johannes Oetsch, Jörg Pührer, and Hans Tompits. Random vs. structure-based testing of answer-set programs: An experimental comparison. In James Delgrande and Wolfgang Faber, editors, Proceedings of the 11th International Conference on Logic Programming and Nonmonotonic Reasoning, volume 6645 of Lecture Notes in Computer Science, pages 242–247, Vancouver, British Columbia, Canada, May 2011. Springer. |
|
|
383 | Tomi Janhunen and Ilkka Niemelä. Compact translations of non-disjunctive answer set programs to propositional clauses. In Marcello Balduccini and Trao Can Son, editors, Proceedings of the Symposium on Constructive Mathematics and Computer Science in Honour of Michael Gelfonds 65th Anniversary, volume 6565 of Lecture Notes in Computer Science, pages 111–130, Lexington, Kentucky, April 2011. Springer. |
|
|
382 | Kari Kähkönen, Tuomas Launiainen, Olli Saarikivi, Janne Kauttio, Keijo Heljanko, and Ilkka Niemelä. LCT: An open source concolic testing tool for Java programs. In Proceedings of the 6th Workshop on Bytecode Semantics, Verification, Analysis and Transformation (BYTECODE'2011), pages 75–80, Saarbrücken, Germany, Mar 2011. |
|
|
381 | Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Partitioning search spaces of a randomized search. Fundamenta Informaticae, 107(2–3):289–311, 2011. |
|
|
380 | Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Grid-based SAT solving with iterative partitioning and clause learning. In CP 2011, volume 6876 of Lecture Notes in Computer Science, pages 385–399. Springer, 2011. |
|
|
379 | Emilia Oikarinen and Stefan Woltran. Characterizing strong equivalence for argumentation frameworks. Artificial Intelligence, 175(14–15):1985–2009, 2011. |
|
|
378 | Victor W. Marek, Ilkka Niemelä, and Mirosław Truszczyński. Origins of answer-set programming – some background and two personal accounts. In Gerhard Brewka, Victor W. Marek, and Mirosław Truszczyński, editors, Nonmonotonic Reasoning: Essays Celebrating its 30th Anniversary, pages 233–258. College Publications, London, UK, 2011. |
|
|
377 | Tommi Junttila and Petteri Kaski. Conflict propagation and component recursion for canonical labeling. In A. Marchetti-Spaccamela and M. Segal, editors, Theory and Practice of Algorithms in (Computer) Systems, First International ICST Conference, TAPAS 2011, Rome, Italy, April 18–20, 2011, volume 6595 of Lecture Notes in Computer Science, pages 151–162. Springer, 2011. |
|
|
376 | Tero Laitinen, Tommi Junttila, and Ilkka Niemelä. Equivalence class based parity reasoning with DPLL(XOR). In Taghi M. Khoshgoftaar and Xingquan (Hill) Zhu, editors, ICTAI 2011 - 23rd IEEE International Conference on Tools with Artificial Intelligence, pages 649–658. IEEE Computer Society Press, 2011. |
|
2010 |
|
375 | Tomi Janhunen and Ilkka Niemelä, editors. Logics in Artificial Intelligence – 12th European Conference, JELIA 2010, Helsinki, Finland, September 13-15, 2010. Proceedings, volume 6341 of Lecture Notes in Computer Science. Springer, September 2010. |
|
|
374 | Tomi Janhunen, Ilkka Niemelä, Johannes Oetsch, Jörg Pührer, and Hans Tompits. On testing answer-set programs. In Helder Coelho, Rudi Studer, and Michael Wooldridge, editors, Proceedings of the 19th European Conference on Artificial Intelligence, pages 951–956, Lisbon, Portugal, August 2010. IOS Press. |
|
|
373 | Tomi Janhunen. Modular construction of ground logic programs using LPCAT. In David Mitchell and Eugenia Ternovska, editors, the 3rd International Workshop on Logic and Search, Edinburgh, Scotland, July 2010. |
|
|
372 | Tomi Janhunen. Sampler programs: The semantics of abstract constraint programs revisited. In Manuel Hermenegildo and Torsten Schaub, editors, Technical Communications of the 26th International Conference on Logic Programming, volume 7 of Leibniz International Proceedings in Informatics (LIPIcs), pages 94–103, Dagstuhl, Germany, July 2010. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. |
|
|
371 | Janne Valkonen, Kim Björkman, Juho Frits, and Ilkka Niemelä. Model checking methodology for verification of safety logics. In Proceedings of the 6th International Conference on Safety of Industrial Automated Systems, SIAS 2010, Tampere, Finland, June 2010. |
|
|
370 | Tuomas Launiainen, Keijo Heljanko, and Tommi Junttila. Efficient model checking of PSL safety properties. In Proceedings of the 10th International Conference on Application of Concurrency to System Design (ACSD'2010), pages 95–104, Braga, Portugal, June 2010. |
|
|
369 | Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Partitioning SAT instances for distributed solving. In Third International Workshop on Logic and Search, pages 1–16, 2010. |
|
|
368 | Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Partitioning SAT instances for distributed solving. In LPAR 2010, volume 6397 of Lecture Notes in Computer Science, pages 372–386. Springer, 2010. |
|
|
367 | Vesa Luukkala and Ilkka Niemelä. Enhancing a smart space with answer set programming. In Proceedings of the 4th International Semantic Web Rule Symposium, RuleML 2010, volume 6403 of Lecture Notes in Computer Science (LNCS), pages 89–103, 2010. |
|
|
366 | Janne Valkonen and Ilkka Niemelä. Turvallisuuskriittisten järjestelmien verifiointi mallintarkastuksella. ATS Ydintekniikka, 39(1):6–8, 2010. |
|
|
365 | Jussi Lahtinen, Janne Valkonen, Kim Björkman, Juho Frits, and Ilkka Niemelä. Model checking methodology for supporting safety critical software development and verification. In Ben J.M. Ale, Ioannis A. Papazoglou, and Enrico Zio, editors, Reliability, Risk and Safety—Back to the Future, pages 2056–2063. CRC Press, 2010. |
|
|
364 | Jussi Lahtinen, Kim Björkman, Janne Valkonen, Juho Frits, and Ilkka Niemelä. Analysis of an emergency diesel generator control system by compositional model checking. VTT Working Papers 156, VTT Technical Research Centre of Finland, Espoo, 2010. |
|
|
363 | Jori Dubrovin. Checking bounded reachability in asynchronous systems by symbolic event tracing. In Gilles Barthe and Manuel Hermenegildo, editors, Proceedings of the 11th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2010), volume 5944 of Lecture Notes in Computer Science, pages 146–162. Springer, 2010. |
|
|
362 | Jussi Lahtinen, Kim Björkman, Janne Valkonen, Juho Frits, and Ilkka Niemelä. Analysis of an emergency diesel generator control system by compositional model checking. VTT Working Papers 156, VTT Technical Research Centre of Finland, Espoo, 2010. |
|
|
361 | Jussi Lahtinen, Janne Valkonen, Kim Björkman, Juho Frits, and Ilkka Niemelä. Model checking methodology for supporting safety critical software development and verification. In Ben J.M. Ale, Ioannis A. Papazoglou, and Enrico Zio, editors, Reliability, Risk and Safety—Back to the Future, pages 2056–2063, Rhodes, Greece, 2010. CRC Press. |
|
|
360 | Kari Kähkönen, Roland Kindermann, Keijo Heljanko, and Ilkka Niemelä. Experimental comparison of concolic and random testing for Java Card applets. In SPIN, volume 6349 of Lecture Notes in Computer Science, pages 22–39, 2010. |
|
|
359 | Juha Saarinen, Emilia Oikarinen, Mikael Fortelius, and Heikki Mannila. The living and the fossilized: how well do unevenly distributed points capture the faunal information in a grid. Evolutionary Ecology Research, 12:363–376, 2010. |
|
|
358 | Tommi Junttila and Petteri Kaski. Exact cover via satisfiability: an empirical study. In David Cohen, editor, Proceedings of 16th International Conference on Principles and Practice of Constraint Programming (CP 2010, St. Andrews, Scotland, September 6-10), number 6308 in Lecture Notes in Computer Science, pages 297–304. Springer, 2010. |
|
|
357 | Tero Laitinen, Tommi A. Junttila, and Ilkka Niemelä. Extending clause learning DPLL with parity reasoning. In Helder Coelho, Rudi Studer, and Michael Wooldridge, editors, ECAI 2010 - 19th European Conference on Artificial Intelligence, Lisbon, Portugal, August 16-20, 2010, Proceedings, volume 215 of Frontiers in Artificial Intelligence and Applications, pages 21–26. IOS Press, 2010. |
|
2009 |
|
356 | Kari Kähkönen. Automated test generation for software components. Technical Report TKK-ICS-R26, Helsinki University of Technology, Department of Information and Computer Science, Espoo, Finland, December 2009. |
|
|
355 | Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Partitioning search spaces of a randomized search. Technical Report TKK-ICS-R22, Helsinki University of Technology, Department of Information and Computer Science, Espoo, Finland, November 2009. |
|
|
354 | Tomi Janhunen, Ilkka Niemelä, and Mark Sevalnev. Computing stable models via reductions to difference logic. In Esra Erdem, Fangzhen Lin, and Torsten Schaub, editors, Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning, volume 5753 of Lecture Notes in Computer Science, pages 142–154, Potsdam, Germany, September 2009. Springer-Verlag. |
|
|
353 | Tomi Janhunen, Emilia Oikarinen, Hans Tompits, and Stefan Woltran. Modularity aspects of disjunctive stable models. Journal of Artificial Intelligence Research, 35:813–857, August 2009. |
|
|
352 | Kim Björkman, Juho Frits, Janne Valkonen, Jussi Lahtinen, Keijo Heljanko, Ilkka Niemelä, and Jari J. Hämäläinen. Verification of safety logic designs by model checking. In Proceedings of the Sixth American Nuclear Society International Topical Meeting on Nuclear Plant Instrumentation, Control, and Human-Machine Interface Technologies NPIC&HMIT 2009, Knoxville, Tennessee, April 2009. |
|
|
351 | Kim Björkman, Juho Frits, Janne Valkonen, , Keijo Heljanko, Ilkka Niemelä, and Jari J. Hämäläinen. Verification of safety logic designs by model checking. In Proceedings of the Sixth American Nuclear Society International Topical Meeting on Nuclear Plant Instrumentation, Control, and Human-Machine Interface Technologies NPIC&HMIT 2009, Knoxville, Tennessee, April 2009. |
|
|
350 | Rolf Drechsler, Tommi Junttila, and Ilkka Niemelä. Non-clausal SAT and ATPG. In Armin Biere, Marijn J. H. Heule, Hans van Maaren, and Toby Walsh, editors, Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications, chapter 21, pages 655–693. IOS Press, February 2009. |
|
|
349 | Rolf Drechsler, Tommi Junttila, and Ilkka Niemelä. Non-clausal SAT and ATPG. In Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh, editors, Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications, chapter 21, pages 655–693. IOS Press, February 2009. |
|
|
348 | Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Incorporating clause learning in grid-based randomized SAT solving. Journal on Satisfiability, Boolean Modeling and Computation, 6:223–244, 2009. |
|
|
347 | Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Partitioning search spaces of a randomized search. In AI*IA 2009, volume 5883 of Lecture Notes in Artificial Intelligence, pages 243–252. Springer, 2009. |
|
|
346 | Tommi Syrjänen. Logic Programs and Cardinality Constraints: Theory and Practice. Doctoral dissertation, TKK Dissertations in Information and Computer Science TKK-ICS-D12, Helsinki University of Technology, Faculty of Information and Natural Sciences, Department of Information and Computer Science, Espoo, Finland, 2009. |
|
|
345 | Antti E.J. Hyvärinen. Approaches to Grid-Based SAT Solving. Licentiate's thesis, Helsinki University of Technology, Department of Information and Computer Science, 2009. |
|
|
344 | Emilia Oikarinen and Tomi Janhunen. A translation-based approach to the verification of modular equivalence. Journal of Logic and Computation, 19(4):591–613, 2009. |
|
|
343 | Matti Järvisalo, Emilia Oikarinen, Tomi Janhunen, and Ilkka Niemelä. A module-based framework for multi-language constraint modeling. In Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2009), 2009. |
|
|
342 | Emilia Oikarinen and Matti Järvisalo. Max-ASP: Maximum satisfiability of answer set programs. In Esra Erdem, Fangzhen Lin, and Torsten Schaub, editors, Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2009), volume 5753 of Lecture Notes in Artificial Intelligence, pages 236–249. Springer, 2009. |
|
|
341 | Matti Järvisalo, Emilia Oikarinen, Tomi Janhunen, and Ilkka Niemelä. A module-based framework for multi-language constraint modeling. In Esra Erdem, Fangzhen Lin, and Torsten Schaub, editors, Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2009), volume 5753 of Lecture Notes in Artificial Intelligence, pages 155–169. Springer, 2009. |
|
|
340 | Kim Björkmann, Juho Frits, Janne Valkonen, Keijo Heljanko, and Ilkka Niemelä. Model-based analysis of a stepwise shutdown logic. VTT Working Papers 115, VTT Technical Research Centre of Finland, Espoo, 2009. |
|
|
339 | Janne Valkonen, Matti Koskimies, Kim Björkman, Keijo Heljanko, Ilkka Niemelä, and Jari J. Hämäläinen. Formal verification of safety automation logic designs. In Automaatio XVIII 2009 Seminaari, 2009. |
|
|
338 | Ilkka Niemelä. Integrating answer set programming and satisfiability modulo theories. In Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2009, volume 5753 of Lecture Notes in Computer Science, page 3, 2009. |
|
|
337 | Alessandro Cimatti, Jori Dubrovin, Tommi Junttila, and Marco Roveri. Structure-aware computation of predicate abstraction. In Armin Biere and Carl Pixley, editors, Proceedings of the 9th International Conference on Formal Methods in Computer Aided Design (FMCAD 2009), pages 9–16. IEEE, 2009. |
|
|
336 | Kim Björkman, Juho Frits, Janne Valkonen, Keijo Heljanko, and Ilkka Niemelä. Model-based analysis of a stepwise shutdown logic. VTT Working Papers 115, VTT Technical Research Centre of Finland, Espoo, 2009. |
|
|
335 | Kari Kähkönen, Jani Lampinen, Keijo Heljanko, and Ilkka Niemelä. The LIME interface specification language and runtime monitoring tool. In Saddek Bensalem and Doron Peled, editors, RV, volume 5779 of Lecture Notes in Computer Science, pages 93–100, 2009. |
|
|
334 | Matti Järvisalo. Structure-based satisfiability checking: Analyzing and harnessing the potential. AI Communications, 22(2):117–119, 2009. Thesis summary. |
|
|
333 | Matti Järvisalo and Tommi Junttila. Limitations of restricted branching in clause learning. Constraints, 14(3):325–356, 2009. |
|
|
332 | Tomi Janhunen. lp2diff 1.23 — Translating logic programs into difference logic. http://www.tcs.hut.fi/Software/lp2diff/, 2009. Computer Program. |
|
2008 |
|
331 | Tomi Janhunen. Removing redundancy from answer set programs. In Enrico Pontelli and Maria Garcia de La Banda, editors, Proceedings of the 24th International Conference on Logic Programming, pages 729–733, Udine, Italy, December 2008. Springer-Verlag. LNCS 5366. |
|
|
330 | Tomi Janhunen, Ilkka Niemelä, and Mark Sevalnev. Computing stable models via reductions to boolean circuits and difference logic. In Marc Denecker, editor, Proceedings of the 2nd International Workshop on Logic and Search, pages 16–30, Leuven, Belgium, November 2008. |
|
|
329 | Martin Gebser, Tomi Janhunen, Max Ostrowski, Torsten Schaub, and Sven Thiele. A versatile intermediate language for answer set programming. In Maurice Pagnucco and Michael Thielscher, editors, Proceedings of the 12th International Workshop on Nonmonotonic Reasoning, pages 150–159, Sydney, Australia, September 2008. University of New South Wales, School of Computer Science and Engineering, Techical Report, UNSW-CSE-TR-0819. |
|
|
328 | Tomi Janhunen. Modular equivalence in general. In Malik Ghallab, Constantine Spyropoulos, Nikos Fakotakis, and Nikos Avouris, editors, Proceedings of the 18th European Conference on Artificial Intelligence, pages 75–79, Patras, Greece, July 2008. IOS Press. |
|
|
327 | Matti Koskimies. Applying model checking to analysing safety instrumented systems. Research Report TKK-ICS-R5, Helsinki University of Technology, Department of Information and Computer Science, Espoo, Finland, June 2008. |
|
|
326 | Jani Lampinen. Interface specification methods for software components. Research Report TKK-ICS-R4, Helsinki University of Technology, Department of Information and Computer Science, Espoo, Finland, June 2008. |
|
|
325 | Jussi Lahtinen. Model checking timed safety instrumented systems. Research Report TKK-ICS-R3, Helsinki University of Technology, Department of Information and Computer Science, Espoo, Finland, June 2008. |
|
|
324 | Janne Valkonen, Matti Koskimies, Ville Pettersson, Keijo Heljanko, Jan-Erik Holmberg, Ilkka Niemelä, and Jari J. Hämäläinen. Formal verification of safety I&C system designs: Two nuclear power plant related applications. In Enlarged Halden Programme Group Meeting – Proceedings of the Man-Technology-Organisation Sessions, page C4.2, Loen, Norway, May 2008. Institutt for Energiteknikk, Halden, Norway. |
|
|
323 | Janne Valkonen, Ilkka Karanta, Matti Koskimies, Keijo Heljanko, Ilkka Niemelä, Dan Sheridan, and Robin E. Bloomfield. NPP safety automation systems analysis – State of the art. VTT Working Papers 94, VTT Technical Research Centre of Finland, Espoo, Finland, April 2008. |
|
|
322 | Janne Valkonen, Ville Petterson, Kim Björkman, Jan-Erik Holmberg, Matti Koskimies, Keijo Heljanko, and Ilkka Niemelä. Model-based analysis of an arc protection and an emergency cooling system – MODSAFE 2007 working report. VTT Working Papers 93, VTT Technical Research Centre of Finland, Espoo, Finland, February 2008. |
|
|
321 | Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Strategies for solving SAT in Grids by randomized search. In Serge Autexier, John Campbell, Julio Rubio, Volker Sorge, Masakazu Suzuki, and Freek Wiedijk, editors, AISC 2008, volume 5144 of Lecture Notes in Artificial Intelligence, pages 125–140. Springer, 2008. |
|
|
320 | Mikko Juhani Pitkanen, Xin Zhou, Antti E. J. Hyvärinen, and Henning Müller. Using the Grid for enhancing the performance of a medical image search engine. In Proceedings of the The Tewnty-First IEEE International Symposium on Computer-Based Medical Systems, June 17-19, 2008, Jyväskylä, Finland, pages 367–372. IEEE, 2008. |
|
|
319 | Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Incorporating learning in grid-based randomized sat solving. In Daniel Dochev, Marco Pistore, and Paolo Traverso, editors, AIMSA 2008, volume 5253 of Lecture Notes in Artificial Intelligence, pages 247–261. Springer, 2008. |
|
|
318 | Matti Järvisalo. Structure-Based Satisfiability Checking: Analyzing and Harnessing the Potential. Doctoral dissertation, TKK Dissertations in Information and Computer Science TKK-ICS-D10, Helsinki University of Technology, Faculty of Information and Natural Sciences, Department of Information and Computer Science, Espoo, Finland, 2008. |
|
|
317 | Emilia Oikarinen. Modularity in Answer Set Programs. Doctoral dissertation, TKK Dissertations in Information and Computer Science TKK-ICS-D7, Helsinki University of Technology, Faculty of Information and Natural Sciences, Department of Information and Computer Science, Espoo, Finland, 2008. |
|
|
316 | Vesa Ojala. Counterexample analysis for automated refinement of data abstracted state machine models. Master's thesis, Helsinki University of Technology, Department of Information and Computer Science, 2008. |
|
|
315 | Kari Kähkönen. Automated dynamic test generation for sequential Java programs. Master's thesis, Helsinki University of Technology, Department of Information and Computer Science, 2008. |
|
|
314 | Jussi Lahtinen. Model checking timed safety instrumented systems. Master's thesis, Helsinki University of Technology, Department of Information and Computer Science, 2008. |
|
|
313 | Jani Lampinen. Interface specification methods for software components. Master's thesis, Helsinki University of Technology, Department of Information and Computer Science, 2008. |
|
|
312 | Matti Koskimies. Applying model checking to analysing safety instrumented systems. Master's thesis, Helsinki University of Technology, Department of Information and Computer Science, 2008. |
|
|
311 | Emilia Oikarinen and Tomi Janhunen. Implementing prioritized circumscription by computing disjunctive stable models. In Danail Dochev, Marco Pistore, and Paolo Traverso, editors, Artificial Intelligence: Methodology, Systems, and Applications, 13th International Conference, AIMSA 2008, Varna, Bulgaria, September 2008 Proceedings, volume 5223 of Lecture Notes in Artificial Intelligence, pages 167–180. Springer, 2008. |
|
|
310 | Emilia Oikarinen and Tomi Janhunen. Achieving compositionality of the stable model semantics for smodels programs. Theory and Practice of Logic Programming, 8(5–6):717–761, 2008. |
|
|
309 | Victor Marek, Ilkka Niemelä, and Mirosław Truszczyński. Programs with monotone abstract constraint atoms. Theory and Practice of Logic Programming, 8(2):167–199, 2008. |
|
|
308 | Gerhard Brewka, Ilkka Niemelä, and Mirosl aw Truszczyński. Nonmonotonic reasoning. In Frank van Harmelen, Vladimir Lifschitz, and Bruce Porter, editors, Handbook of Knowledge Representation, chapter 6, pages 239–284. Elsevier Science, Amsterdam, 2008. |
|
|
307 | Janne Valkonen, Ville Pettersson, Kim Björkman, Jan-Erik Holmberg, Matti Koskimies, Keijo Heljanko, and Ilkka Niemelä. Model-based analysis of an arc protection and an emergency cooling system. VTT Working Papers 93, VTT Technical Research Centre of Finland, Espoo, 2008. |
|
|
306 | Janne Valkonen, Ilkka Karanta, Matti Koskimies, Keijo Heljanko, Ilkka Niemelä, Dan Sheridan, and Robing E. Bloomfield. NPP safety automation systems analysis: State of the art. VTT Working Papers 94, VTT Technical Research Centre of Finland, Espoo, 2008. |
|
|
305 | Janne Valkonen, Matti Koskimies, Ville Pettersson, Keijo Heljanko, Jan-Erik Holmberg, Ilkka Niemelä, and Jari J. Hämäläinen. Formal verification of safety I&C system designs: Two nuclear power plant related applications. In Enlarged Halden Programme Group Meeting – Proceedings of the Man-Technology-Organisation Sessions, page C4.2. Institutt for Energiteknikk, Halden, Norway, 2008. |
|
|
304 | Ilkka Niemelä. Answer set programming without unstratified negation. In Proceedings of the 24th International Conference on Logic Programming (ICLP 2008), volume 5366 of Lecture Notes in Computer Science, pages 88–92. Springer, 2008. |
|
|
303 | Ilkka Niemelä. Stable models and difference logic. In Proceedings of the Tenth International Symposium on Artificial Intelligence and Mathematics, page 5 p., 2008. The proceedings available at http://isaim2008.unl.edu/index.php?page=proceedings. |
|
|
302 | Gerd Brewka, Ilkka Niemelä, and Mirosław Truszczyński. Preferences and nonmonotonic reasoning. AI Magazine, 29(4):69–78, 2008. |
|
|
301 | Ilkka Niemelä. Stable models and difference logic. Annals of Mathematics and Artificial Intelligence, 53(1–4):313–329, 2008. |
|
|
300 | Jori Dubrovin, Tommi Junttila, and Keijo Heljanko. Symbolic step encodings for object based communicating state machines. In Gilles Barthe and Frank S. de Boer, editors, Proceedings of the 10th IFIP International Conference on Formal Methods for Open Object-based Distributed Systems (FMOODS 2008), volume 5051 of Lecture Notes in Computer Science, pages 96–112. Springer, 2008. |
|
|
299 | Jori Dubrovin and Tommi Junttila. Symbolic model checking of hierarchical UML state machines. In Jonathan Billington, Zhenhua Duan, and Maciej Koutny, editors, Proceedings of the 8th International Conference on Application of Concurrency to System Design (ACSD 2008), pages 108–117. IEEE Press, 2008. |
|
|
298 | Matti Järvisalo and Emilia Oikarinen. Extended ASP tableaux and rule redundancy in normal logic programs. Theory and Practice of Logic Programming, 8(5–6):691–716, 2008. |
|
|
297 | Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä. Justification-based local search with adaptive noise strategies. In Iliano Cervesato, Helmut Veith, and Andrei Voronkov, editors, Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR'08), volume 5330 of Lecture Notes in Computer Science, pages 31–46. Springer, 2008. |
|
|
296 | Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä. Justification-based local search with adaptive noise strategies. In Proceedings of the 2nd International Workshop on Logic and Search: Computation of structures from declarative descriptions (LaSh'08), pages 111–125. KU Leuven, 2008. |
|
|
295 | Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä. Justification-based non-clausal local search for SAT. In Malik Ghallab, Constantine D. Spyropoulos, Nikos Fanotakis, and Nikos Avoukis, editors, Proceedings of the 18th European Conference on Artificial Intelligence (ECAI 2008), volume 178 of Frontiers in Artificial Intelligence and Applications, pages 535–539. IOS Press, 2008. |
|
|
294 | Matti Järvisalo and Tommi Junttila. On the power of top-down branching heuristics. In Dieter Fox and Carla P. Gomes, editors, Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI-08), pages 304–309. AAAI Press, 2008. |
|
|
293 | Matti Järvisalo and Ilkka Niemelä. The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study. Journal of Algorithms, 63(1–3):90–113, 2008. |
|
|
292 | Tommi Junttila and Jori Dubrovin. Encoding queues in satisfiability modulo theories based bounded model checking. In Iliano Cervesato, Helmut Veith, and Andrei Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'08), volume 5330 of Lecture Notes in Artificial Intelligence, pages 290–304. Springer, 2008. |
|
2007 |
|
291 | Jori Dubrovin and Tommi Junttila. Symbolic model checking of hierarchical UML state machines. Technical Report B23, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2007. |
|
|
290 | Jori Dubrovin, Tommi Junttila, and Keijo Heljanko. Symbolic step encodings for object based communicating state machines. Technical Report B24, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2007. |
|
|
289 | Vesa Ojala. A slicer for UML state machines. Technical Report B25, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2007. |
|
|
288 | Tomi Janhunen and Emilia Oikarinen. Automated verification of weak equivalence within the smodels system. Theory and Practice of Logic Programming, 7(6):697–744, November 2007. |
|
|
287 | Emilia Oikarinen and Tomi Janhunen. A linear transformation from prioritized circumscription to disjunctive logic programming. In Verónica Dahl and Ilkka Niemelä, editors, Proceedings of the 23rd International Conference on Logic Programming (ICLP 2007), volume 4670 of Lecture Notes in Computer Science, pages 440–441, Porto, Portugal, September 2007. Springer. Poster. |
|
|
286 | Emilia Oikarinen. Modular answer set programming. In Verónica Dahl and Ilkka Niemelä, editors, Proceedings of the 23rd International Conference on Logic Programming (ICLP 2007), volume 4670 of Lecture Notes in Computer Science, pages 462–463, Porto, Portugal, September 2007. Springer. Doctoral Consortium research summary. |
|
|
285 | Emilia Oikarinen and Tomi Janhunen. A translation-based approach to the verification of modular equivalence. In Stefania Costantini and Richard Watson, editors, Proceedings of the 4th Workshop on Answer Set Programming; Advances in Theory and Implementation (ASP 2007), pages 255–269, Porto, Portugal, September 2007. |
|
|
284 | Matti Järvisalo. Impact of restricted branching on clause learning SAT solving. Research Report A107, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, August 2007. ISBN 978-951-22-8907-3. |
|
|
283 | Emilia Oikarinen. Modularity in smodels programs. In Chitta Baral, Gerhard Brewka, and John Schlipf, editors, Logic Programming and Nonmonotonic Reasoning, 9th International Conference on Logic Programming and Nonmonotonic Reasoning LPNMR 2007, Tempe, AZ, USA, May 2007, Proceedings, volume 4483 of Lecture Notes in Artificial Intelligence, pages 321–326, Tempe, Arizona, USA, May 2007. Springer-Verlag. Poster. |
|
|
282 | Emilia Oikarinen. Modular answer set programming. In Veli Mäkinen, Greger Lindén, and Hannu Toivonen, editors, Summer School on Algorithmic Data Analysis (SADA 2007) and Annual Hecse Poster Session. Poster Abstracts, Series of Publications B, Report B-2007-4, page 62. Helsinki University Printing House, May 2007. |
|
|
281 | Tomi Janhunen, Emilia Oikarinen, Hans Tompits, and Stefan Woltran. Modularity aspects of disjunctive stable models. In Chitta Baral, Gerhard Brewka, and John Schlipf, editors, Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 175–187, Tempe, Arizona, USA, May 2007. Springer-Verlag. |
|
|
280 | Tomi Janhunen. Intermediate languages of ASP systems and tools. In Marina De Vos and Torsten Schaub, editors, Proceedings of the 1st International Workshop on Software Engineering for Answer Set Programming, number CSBU-2007-05 in Deparment of Computer Science, University of Bath, Technical Report Series, pages 12–25, Tempe, Arizona, USA, May 2007. |
|
|
279 | Emilia Oikarinen. circ2dlp 2.1 — a linear translation from prioritized circumscription to disjunctive logic programming, April 2007. Computer Program. |
|
|
278 | Matti Järvisalo. Impact of Restricted Branching on Clause Learning SAT Solving. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2007. |
|
|
277 | Verónica Dahl and Ilkka Niemelä, editors. Logic Programming, 23rd International Conference, ICLP 2007, Porto, Portugal, September 8-13, 2007, Proceedings, volume 4670 of Lecture Notes in Computer Science. Springer, 2007. |
|
|
276 | Jori Dubrovin. SMUML/Suboco 1.10 — an SMT-based UML bounded model checker, 2007. Computer program. |
|
|
275 | Jori Dubrovin. SMUML/Uboco 1.10 — a translator from UML models to NuSMV programs, 2007. Computer program. |
|
|
274 | Matti Järvisalo. Restricted branching in clause learning DPLL. In Brahim Hnich and Kostas Stergiou, editors, Proceedings of the CP 2007 Doctoral Program, pages 55–60, 2007. |
|
|
273 | Matti Järvisalo and Tommi Junttila. Limitations of restricted branching in clause learning. In Christian Bessiere, editor, Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming (CP 2007), volume 4741 of Lecture Notes in Computer Science, pages 348–363. Springer, 2007. |
|
|
272 | Matti Järvisalo. Equivalence checking hardware multiplier designs, 2007. SAT Competition 2007 benchmark description. Available at http://www.satcompetition.org/2007/contestants.html. |
|
|
271 | Matti Järvisalo. The effect of structural branching on the efficiency of clause learning SAT solving. In 14th RCRA Workshop: Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2007. See http://pst.istc.cnr.it/RCRA07/program.html. |
|
|
270 | Matti Järvisalo. Industrial-strength SAT solving and restricted branching. In Veli Mäkinen, Greger Lindén, and Hannu Toivonen, editors, Summer School on Algorithmic Data Analysis (SADA 2007) and Annual Hecse Poster Session. Abstract proceedings, Series of Publications B, Report B-2007-4, page 39. Helsinki University Printing House, 2007. |
|
|
269 | Matti Järvisalo and Emilia Oikarinen. Extended ASP tableaux and rule redundancy in normal logic programs. In Verónica Dahl and Ilkka Niemelä, editors, Proceedings of the 23rd International Conference on Logic Programming (ICLP 2007), volume 4670 of Lecture Notes in Computer Science, pages 134–148. Springer, 2007. |
|
|
268 | Tommi Junttila and Petteri Kaski. Engineering an efficient canonical labeling tool for large and sparse graphs. In David Applegate, Gerth Stølting Brodat, Daniel Panario, and Robert Sedgewick, editors, Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithms and Combinatorics. SIAM, 2007. |
|
|
267 | Matti Järvisalo and Tommi Junttila. Limitations of restricted branching in clause learning. In Christian Bessiere, editor, Principles and Practice of Constraint Programming – CP 2007, volume 4741 of Lecture Notes in Computer Science, pages 348–363. Springer, 2007. |
|
|
266 | Tommi Junttila. SMUML/proco version 2.00 — a translator from UML models to Promela, 2007. Computer program. |
|
|
265 | Tommi Junttila. PySMT version 0.50 — a Python front-end for satisfiability modulo theories solvers, 2007. Computer program. |
|
|
264 | Tomi Janhunen. asptools 1.0 — A tool collection for answer set programming. http://www.tcs.hut.fi/Software/asptools/, 2007. Computer Program. |
|
|
263 | Tomi Janhunen. lpeq 1.19 — A tool for testing the modular equivalence of logic programs. http://www.tcs.hut.fi/Software/lpeq/, 2007. Computer Program. |
|
|
262 | Vesa Ojala. SMUML/slicer 1.0.0 — a slicer for slicing UML state machines, 2007. Computer program. |
|
|
261 | Vesa Ojala. SMUML/canal 1.0.0 — a counterexample analysator for analyzing abstract counterexamples from data abstracted UML models, 2007. Computer program. |
|
2006 |
|
260 | Emilia Oikarinen. Modular answer set programming. Research Report A106, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2006. |
|
|
259 | Misa Keinänen. Techniques for solving boolean equation systems. Research Report A105, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, November 2006. Doctoral dissertation. |
|
|
258 | 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. |
|
|
257 | Heikki Tauriainen. Automata and linear temporal logic: Translations with transition-based acceptance. Research Report A104, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, September 2006. Doctoral dissertation. |
|
|
256 | Emilia Oikarinen and Tomi Janhunen. Modular equivalence for normal logic programs. In Gerhard Brewka, Silvia Coradeschi, Anna Perini, and Paolo Traverso, editors, Proceedings of the 17th European Conference on Artificial Intelligence, pages 412–416, Riva del Garda, Italy, August 2006. IOS Press. |
|
|
255 | Keijo Heljanko, Tommi Junttila, Misa Keinänen, Martin Lange, and Timo Latvala. Bounded model checking for weak alternating Büchi automata. In Thomas Ball and Robert B. Jones, editors, Proceedings of the 18th International Conference on Computer Aided Verification (CAV'2006), volume 4144 of Lecture Notes in Computer Science, pages 95–108, Seattle, WA, USA, August 2006. Springer-Verlag. |
|
|
254 | Jean Gressmann, Tomi Janhunen, Robert Mercer, Torsten Schaub, Sven Thiele, and Richard Tichy. On probing and multi-threading in platypus. In Gerhard Brewka, Silvia Coradeschi, Anna Perini, and Paolo Traverso, editors, Proceedings of the 17th European Conference on Artificial Intelligence, pages 392–396, Riva del Garda, Italy, August 2006. IOS Press. |
|
|
253 | Christian Anger, Martin Gebser, Tomi Janhunen, and Torsten Schaub. What's a head without a body?. In Gerhard Brewka, Silvia Coradeschi, Anna Perini, and Paolo Traverso, editors, Proceedings of the 17th European Conference on Artificial Intelligence, pages 769–770, Riva del Garda, Italy, August 2006. IOS Press. |
|
|
252 | Antti E. J. Hyvärinen. Satu (sat ubiquitous), June 2006. Computer program. |
|
|
251 | Tomi Janhunen. Some (in)translatability results for normal logic programs and propositional theories. Journal of Applied Non-Classical Logics, 16(1–2):35–86, June 2006. Special issue on implementation of logics. |
|
|
250 | Emilia Oikarinen and Tomi Janhunen. Modular equivalence for normal logic programs. In Jüergen Dix and Anthony Hunter, editors, Proceedings of the 11th International Workshop on Nonmonotonic Reasoning, pages 10–18, Lake District, UK, May 2006. University of Clausthal, Department of Informatics, Technical Report, IfI-06-04. |
|
|
249 | Tommi Syrjänen. Debugging inconsistent answer set programs. In Proceedings of the 11th International Workshop on Non-Monotonic Reasoning, pages 77–84, Lake District, UK, May 2006. |
|
|
248 | Jean Gressmann, Tomi Janhunen, Robert Mercer, Torsten Schaub, Sven Thiele, and Richard Tichy. On probing and multi-threading in platypus. In Jüergen Dix and Anthony Hunter, editors, Proceedings of the 11th International Workshop on Nonmonotonic Reasoning, pages 30–38, Lake District, UK, May 2006. University of Clausthal, Department of Informatics, Techical Report, IfI-06-04. |
|
|
247 | Jori Dubrovin. Jumbala — an action language for UML state machines. Research Report A101, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, March 2006. |
|
|
246 | Antti E. J. Hyvärinen. SATU: A system for distributed propositional satisfiability checking in computational grids. Research Report A100, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, February 2006. |
|
|
245 | Matti Järvisalo. drgen — regular  -XORSAT generator, February 2006. Computer program. |
|
|
244 | Antti E. J. Hyvärinen. Lauselogiikan toteutuvuusongelman ratkaiseminen laskennallisessa gridissä. In Lea Kutvonen and Päivi Kuuppelomäki, editors, Tietojenkäsittelytieteen päivät 2006, volume B-2006-3 of Tietojenkäsittelytieteen laitoksen julkaisjua sarja B, pages 37 – 43. Tietojenkäsittelytieteen laitos, 2006. |
|
|
243 | Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. A distribution method for solving SAT in grids. In Armin Biere and Carla P. Gomes, editors, SAT 2006, volume 4121 of Lecture Notes in Computer Science, pages 430–435. Springer, 2006. |
|
|
242 | Emilia Oikarinen. Modular Answer Set Programming. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2006. |
|
|
241 | Jori Dubrovin. Jumbala — an action language for UML state machines. Master's thesis, Helsinki University of Technology, Department of Engineering Physics and Mathematics, 2006. |
|
|
240 | Ilkka Niemelä. Answer set programming: A declarative approach to solving search problems. In Proceedings of the 10th European Conference on Logics in Artificial Intelligence, volume 4160 of Lecture Notes in Computer Science, pages 15–18. Springer, 2006. |
|
|
239 | Ilkka Niemel a. Bounded model checking, answer set programming, and fixed points. In Proceedings of the CAV'06 Workshop on Bounded Model Checking (BMC06), page 9, 2006. Abstract of an invited talk. |
|
|
238 | Ilkka Niemelä. Answer set programming: Foundations, implementation techniques, and applications. In Proceedings of the ICLP 2006 Workshop on Search and Logic: Answer Set Programming and SAT, page 35, 2006. Abstract of an invited talk. |
|
|
237 | Armin Biere, Keijo Heljanko, Tommi Junttila, Timo Latvala, and Viktor Schuppan. Linear encodings of bounded LTL model checking. Logical Methods in Computer Science, 2(5:5), 2006. (doi: 10.2168/LMCS-2(5:5)2006). |
|
|
236 | Jussi Rintanen, Keijo Heljanko, and Ilkka Niemelä. Planning as satisfiability: parallel plans and algorithms for plan search. Artificial Intelligence, 170(12-13):1031–1080, 2006. |
|
|
235 | Matti Järvisalo. Further investigations into regular XORSAT. In Proceedings of the Twenty-First National Conference on Artificial Intelligence (AAAI-06), pages 1873–1874. AAAI Press, 2006. Poster. |
|
|
234 | Harri Haanpää, Matti Järvisalo, Petteri Kaski, and Ilkka Niemelä. Hard satisfiable clause sets for benchmarking equivalence reasoning techniques. Journal on Satisfiability, Boolean Modeling and Computation, 2(1-4):27–46, 2006. |
|
|
233 | Matti Järvisalo. Opinions, hopes, and expectations of CS&E students, a case study in academic skills and hidden curriculum. In Tapio Salakoski, Tomi Mäntylä, and Mikko Laakso, editors, Koli Calling 2005 – Proceedings of the Fifth Finnish / Baltic Sea Conference on Computer Science Education, volume 41 of TUCS General Publications, pages 157–161. Turku Centre for Computer Science, 2006. ISBN 951-29-3006-4. |
|
|
232 | Timo Latvala and Tommi Junttila. Nusmv-2.3.99-cav2006. Computer program, 2006. |
|
|
231 | Toni Jussila, Jori Dubrovin, Tommi Junttila, Timo Latvala, and Ivan Porres. Model checking dynamic and hierarchical UML state machines. In MoDeV a: Model Development, Validation and Verification; 3rd International Workshop, Genova, Italy, October 2006, pages 94–110, 2006. |
|
|
230 | 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. |
|
|
229 | Tomi Janhunen. lp2sat 1.10 — A tool for translating normal logic programs into SAT. http://www.tcs.hut.fi/Software/lp2sat/, 2006. Computer Program. |
|
2005 |
|
228 | Misa Keinänen. Solving boolean equation systems. Research Report A99, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, November 2005. |
|
|
227 | 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. |
|
|
226 | 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. |
|
|
225 | 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. |
|
|
224 | 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. |
|
|
223 | Heikki Tauriainen. A note on the worst-case memory requirements of generalized nested depth-first search. Research Report A96, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, September 2005. |
|
|
222 | Emilia Oikarinen and Tomi Janhunen. CIRC2DLP — translating circumscription into disjunctive logic programming. In Chitta Baral, Gianluigi Grego, Nicola Leone, and Giorgio Terracina, editors, Logic Programming and Nonmonotonic Reasoning, Proceedings of the 8th International Conference on Logic Programming and Nonmonotonic Reasoning, volume 3662 of Lecture Notes in Artificial Intelligence, pages 405–409, Diamante, Italy, September 2005. Springer-Verlag. System Description. |
|
|
221 | Matti Järvisalo. rgen — a SAT benchmark generator, September 2005. Computer program. |
|
|
220 | Jean Gressmann, Tomi Janhunen, Robert Mercer, Torsten Schaub, Sven Thiele, and Richard Tichy. Platypus: A platform for distributed answer set solving. In Chitta Baral, Gianluigi Greco, Nicola Leone, and Giorgio Terracina, editors, Proceedings of the 8th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 227–239, Diamante, Italy, September 2005. Springer-Verlag. |
|
|
219 | 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. |
|
|
218 | Emilia Oikarinen. Translating parallel circumscription into disjunctive logic programming. In ICCL Summer School Student Workshop 2005, Dresden, Germany, July 2005. TU Dresden. |
|
|
217 | Gerd Brewka, Ilkka Niemelä, and Mirosław Truszczyński. Prioritized component systems. In Proceedings of the Twentieth National Conference on Artificial Intelligence, pages 596–601. AAAI Press, July 2005. |
|
|
216 | Keijo Heljanko, Tommi Junttila, and Timo Latvala. Incremental and complete bounded model checking for full PLTL. In Kousha Etessami and Sriram K. Rajamani, editors, Proceedings of the 17th International Conference on Computer Aided Verification (CAV'2005), volume 3576 of Lecture Notes in Computer Science, pages 98–111, Edinburgh, Scotland, United Kingdom, July 2005. Springer-Verlag. |
|
|
215 | Keijo Heljanko and Alin Stefanescu. Complexity results for checking distributed implementability. In Jörg Desel and Yosinori Watanabe, editors, Proceedings of the 5th International Conference on Application of Concurrency to System Design (ACSD'2005), pages 78–87, St Malo, France, June 2005. IEEE Computer Society. |
|
|
214 | 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. |
|
|
213 | 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. |
|
|
212 | 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. |
|
|
211 | Antti Hyvärinen. SATU: A system for distributed propositional satisfiability checking in computational GRIDs. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2005. |
|
|
210 | 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. |
|
|
209 | Emilia Oikarinen. CIRC2DLP 1.1 — software for translating parallel circumscription to disjunctive logic programming, 2005. Computer Program. |
|
|
208 | 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. |
|
|
207 | Gerhard Brewka, Ilkka Niemelä, Torsten Schaub, Miroslaw Truszczynski, , and Joost Vennekens, editors. 05171 Abstracts Collection – Nonmonotonic Reasoning, Answer Set Programming and Constraints, number 05171 in Dagstuhl Seminar Proceedings. Internationales Begegnungs- und Forschungszentrum (IBFI), Schloss Dagstuhl, Germany, 2005. |
|
|
206 | 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. |
|
|
205 | Harri Haanpää, Matti Järvisalo, Petteri Kaski, and Ilkka Niemelä. SAT benchmarks based on 3-regular graphs, 2005. SAT Competition 2005 benchmark description. Benchmark set available at http://www.tcs.hut.fi/%7Emjj/benchmarks/. SAT Competition 2005 results available through http://www.satcompetition.org/2005/. |
|
|
204 | 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. |
|
|
203 | 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. |
|
|
202 | Tommi Junttila. Nusmv-2.2.3-cav2005. Computer program, 2005. |
|
|
201 | 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. |
|
|
200 | Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi Junttila, Silvio Ranise, Peter van Rossum, and Roberto Sebastiani. Efficient satisfiability modulo theories via delayed theory combination. In Kousha Etessami and Sriram K. Rajamani, editors, CAV 2005, volume 3576 of Lecture Notes in Computer Science, pages 335–349. Springer, 2005. |
|
|
199 | Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi Junttila, Peter van Rossum, Stephan Schulz, and Roberto Sebastiani. The MathSAT 3 system. In Robert Nieuwenhuis, editor, Automated Deduction – CADE-20, volume 3632 of Lecture Notes in Artificial Intelligence, pages 315–321. Springer, 2005. |
|
|
198 | 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. |
|
|
197 | 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 |
|
196 | 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. |
|
|
195 | Keijo Heljanko and Alin Stefanescu. Complexity results for checking distributed implementability. Technical Report 05/2004, Institute of Formal Methods in Computer Science, University of Stuttgart, Stuttgart, Germany, October 2004. |
|
|
194 | Tomi Janhunen, Toni Jussila, Matti Järvisalo, and Emilia Oikarinen. Teaching Smullyan's analytic tableaux in a scalable learning environment. In Ari Korhonen and Lauri Malmi, editors, Proceedings of the 4th Finnish/Baltic Sea Conference on Computer Science Education, pages 85–94, Joensuu, October 2004. Published in the report series of the Laboratory of Information Processing, TKO-A42/04. |
|
|
193 | 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. |
|
|
192 | 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. |
|
|
191 | 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. |
|
|
190 | 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. |
|
|
189 | 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. |
|
|
188 | 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. |
|
|
187 | 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. |
|
|
186 | 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. |
|
|
185 | 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. |
|
|
184 | 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. |
|
|
183 | 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. |
|
|
182 | 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. |
|
|
181 | 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. |
|
|
180 | 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. |
|
|
179 | 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. |
|
|
178 | 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. |
|
|
177 | 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. |
|
|
176 | Tuomo Pyhälä. genfacbm — a benchmark generator based on factoring for SAT and ASP solvers, 2004. Computer program. |
|
|
175 | 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. |
|
|
174 | 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. |
|
|
173 | 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. |
|
|
172 | 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. |
|
|
171 | Gerhard Brewka, Ilkka Niemelä, and Tommi Syrjänen. Logic programs with ordered disjunction. Computational Intelligence, 20(2):333–357, 2004. |
|
|
170 | Matti Järvisalo. Lauselogiikan toteutuvuustarkastus: käytännönläheistä teoriaa. Tietojenkäsittelytiede, 22:47–63, 2004. In Finnish. |
|
|
169 | 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/. |
|
|
168 | 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. |
|
|
167 | 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/. |
|
|
166 | Timo Latvala and Heikki Tauriainen. Improved on-the-fly verification with testers. Nordic Journal of Computing, 11(2):148–164, 2004. |
|
|
165 | 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. |
|
|
164 | 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. |
|
|
163 | Tommi A. Junttila. New orbit algorithms for data symmetries. In Application of Concurrency to System Design 2004, pages 175–184. IEEE, 2004. |
|
|
162 | Toni Jussila. Efficient bounded reachability through iterative strengthening. In Concurrency, Specification and Programming CS&P'2004, 2004. |
|
|
161 | 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. |
|
|
160 | 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. |
|
|
159 | 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 |
|
158 | 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. |
|
|
157 | 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. |
|
|
156 | Tommi Syrjänen. Logic programming with cardinality constraints. Research Report A86, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2003. |
|
|
155 | 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. |
|
|
154 | 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. |
|
|
153 | 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. |
|
|
152 | 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. |
|
|
151 | Toni Jussila. Daa - a BMC tool translating LTSs to boolean circuits, October 2003. http://www.tcs.hut.fi/ tjussila/daa. |
|
|
150 | 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. |
|
|
149 | 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/. |
|
|
148 | 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. |
|
|
147 | 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. |
|
|
146 | 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. |
|
|
145 | 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. |
|
|
144 | 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. |
|
|
143 | 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. |
|
|
142 | Toni Jussila. Otf - a BMC tool translating LTSs to boolean circuits, May 2003. |
|
|
141 | Tomi Janhunen. Evaluating the effect of semi-normality on the expressiveness of defaults. Artificial Intelligence, 144(1–2):233–250, March 2003. |
|
|
140 | 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. |
|
|
139 | 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. |
|
|
138 | 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. |
|
|
137 | Emilia Oikarinen. Testing the equivalence of disjunctive logic programs. Master's thesis, Helsinki University of Technology, Department of Engineering Physics and Mathematics, 2003. |
|
|
136 | Emilia Oikarinen. DLPEQ 1.9 — a tool for testing the equivalence of disjunctive logic programs, 2003. Computer Program. |
|
|
135 | 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. |
|
|
134 | 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. |
|
|
133 | 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). |
|
|
132 | 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. |
|
|
131 | 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 |
|
130 | 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. |
|
|
129 | 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. |
|
|
128 | 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. |
|
|
127 | 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. |
|
|
126 | 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. |
|
|
125 | Tommi Junttila. Symmetry reduction algorithms for data symmetries. Research Report A72, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, May 2002. |
|
|
124 | 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. |
|
|
123 | Patrik Simons, Ilkka Niemelä, and Timo Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138(1–2):181–234, 2002. |
|
|
122 | 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. |
|
|
121 | Tomi Janhunen. lpeq 1.13 — A tool for testing the equivalence of logic programs. http://www.tcs.hut.fi/Software/lpeq/, 2002. Computer Program. |
|
2001 |
|
120 | Keijo Heljanko and Ilkka Niemelä. Bounded LTL model checking with stable models. In Thomas Eiter, Wolfgang Faber, and Mirosaw Truszczynski, editors, Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'2001), volume 2173 of Lecture Notes in Artificial Intelligence, pages 200–212, Vienna, Austria, September 2001. Springer-Verlag. |
|
|
119 | Tommi Syrjänen and Ilkka Niemelä. The smodels system. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning, Vienna, Austria, September 2001. Springer-Verlag. |
|
|
118 | Tomi Janhunen. On the effect of default negation on the expressiveness of disjunctive rules. In Thomas Eiter, Wolfgang Faber, and Mirek Truszczyński, editors, Logic Programming and Nonmonotonic Reasoning, Proceedings of the 6th International Conference, pages 93–106, Vienna, Austria, September 2001. Springer-Verlag. LNAI 2173. |
|
|
117 | Keijo Heljanko. Bounded reachability checking with process semantics. In Kim Guldstrand Larsen and Mogens Nielsen, editors, Proceedings of the 12th International Conference on Concurrency Theory (Concur'2001), volume 2154 of Lecture Notes in Computer Science, pages 218–232, Aalborg, Denmark, August 2001. Springer-Verlag. |
|
|
116 | Stefan Brass, Jürgen Dix, Ilkka Niemelä, and T.C. Przymusinski. On the equivalence of the static and disjunctive well-founded semantics and its computation. Theoretical Computer Science, 258(1–2):523–553, May 2001. |
|
|
115 | Javier Esparza and Keijo Heljanko. Implementing LTL model checking with net unfoldings. In Matthew B. Dwyer, editor, Proceedings of the 8th International SPIN Workshop on Model Checking of Software (SPIN'2001), volume 2057 of Lecture Notes in Computer Science, pages 37–56, Toronto, Canada, May 2001. Springer-Verlag. |
|
|
114 | Tomi Janhunen. On the effect of default negation on the expressiveness of disjunctive rules. In Gerhard Brewka, Cees Witteween, and Torsten Schaub, editors, Working Notes of the 5th Dutch-German Workshop on Nonmonotonic Reasoning Techniques and their Applications, pages 102–113, Potsdam, Germany, April 2001. |
|
|
113 | Keijo Heljanko and Ilkka Niemelä. Answer set programming and bounded model checking. In Proceedings of the AAAI Spring 2001 Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, pages 90–96, Stanford, USA, March 2001. AAAI Press. |
|
|
112 | Timo Soininen, Ilkka Niemelä, Juha Tiihonen, and Reijo Sulonen. Representing configuration knowledge with weight constraint rules. In Proceedings of the AAAI Spring 2001 Symposium on Answer Set Programming, pages 195–201, Stanford, USA, March 2001. AAAI Press. |
|
|
111 | Jürgen Dix, Ulrich Furbach, and Ilkka Niemelä. Nonmonotonic reasoning: Towards efficient calculi and implementations. In Andrei Voronkov and Alan Robinson, editors, Handbook of Automated Reasoning, chapter 19, pages 1241–1354. Elsevier Science, Amsterdam, 2001. |
|
|
110 | Keijo Heljanko. punroll 0.3: a bounded reachability checker. Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, 2001. Software. |
|
|
109 | Keijo Heljanko and Patrik Simons. boundsmodels 0.9: a bounded LTL model checker. Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, 2001. Software. |
|
|
108 | Keijo Heljanko and Patrik Simons. unfsmodels 0.9: a LTL model checker using net unfoldings. Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, 2001. Software. |
|
|
107 | Tommi Junttila. BCSat 0.3 - a satisfiability checker for boolean circuits. Computer program, 2001. |
|
2000 |
|
106 | Heikki Tauriainen. Automated testing of Büchi automata translators for linear temporal logic. Research Report A66, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2000. |
|
|
105 | Nisse Husberg, Tomi Janhunen, and Ilkka Niemelä (Eds.). Leksa notes in computer science. Research Report A63, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, October 2000. |
|
|
104 | Tomi Janhunen. Specifying agent-based systems with nets and logic programs. In Nisse Husberg, Tomi Janhunen, and Ilkka Niemelä, editors, Leksa Notes in Computer Science: Festschrift in Honour of Professor Leo Ojala, pages 33–46, Espoo, October 2000. Helsinki University of Technology, Laboratory for Theoretical Computer Science, Research Reports HUT-TCS-A63. |
|
|
103 | Tomi Janhunen. Capturing stationary and regular extensions with Reiter's extensions. In Manuel Ojeda-Aciego et al., editors, Logics in Artificial Intelligence, European Workshop, JELIA 2000, pages 102–117, Málaga, Spain, September/October 2000. Springer-Verlag. LNAI 1919. |
|
|
102 | Timo Soininen, Ilkka Niemelä, Juha Tiihonen, and Reijo Sulonen. Unified configuration knowledge representation using weight constraint rules. In Workshop Notes of the ECAI'2000 Configuration Workshop, pages 79–84, Berlin, Germany, August 2000. |
|
|
101 | Tommi A. Junttila and Ilkka Niemelä. Towards an efficient tableau method for Boolean circuit satisfiability checking. In John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luís Moniz Pereira, Yehoshua Sagiv, and Peter J. Stuckey, editors, Computational Logic – CL 2000; First International Conference, volume 1861 of Lecture Notes in Artificial Intelligence, pages 553–567, London, UK, July 2000. Springer, Berlin. |
|
|
100 | Tomi Janhunen. Comparing the expressive powers of some syntactically restricted classes of logic programs. In John Lloyd et al., editors, Computational Logic, First International Conference, pages 852–866, London, UK, July 2000. Springer-Verlag. LNAI 1861. |
|
|
99 | Maarit Hietalahti, Fabio Massacci, and Ilkka Niemelä. DES: a challenge problem for nonmonotonic reasoning systems. In Proceedings of the 8th International Workshop on Non-Monotonic Reasoning (cs.AI/0003073), Breckenridge, Colorado, USA, April 2000. cs.AI/0003039. |
|
|
98 | Ilkka Niemelä, Patrik Simons, and Tommi Syrjänen. Smodels: a system for answer set programming. In Proceedings of the 8th International Workshop on Non-Monotonic Reasoning (cs.AI/0003073), Breckenridge, Colorado, USA, April 2000. cs.AI/0003033. |
|
|
97 | Tomi Janhunen, Ilkka Niemelä, Patrik Simons, and Jia-Huai You. Unfolding partiality and disjunctions in stable model semantics. In Anthony Cohn, Fausto Giunchiglia, and Bart Selman, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the 7th International Conference, pages 411–419, Breckenridge, Colorado, April 2000. Morgan Kaufmann. |
|
|
96 | Ilkka Niemelä and Patrik Simons. Extending the Smodels system with cardinality and weight constraints. In Jack Minker, editor, Logic-Based Artificial Intelligence, chapter 21, pages 491–521. Kluwer Academic Publishers, 2000. |
|
|
95 | Ilkka Niemelä. Stable model semantics: From theory to implementations and applications. Lecture notes for a tutorial given at the First International Conference on Computational Logic, Imperial College, London, UK, July 24–28, 2000. 72 pages., 2000. |
|
|
94 | Ilkka Niemelä and Mirosław Truszczyński. Practical tools for knowledge representation and nonmonotonic reasoning. Lecture notes for a tutorial given at the 17th National Conference on Artificial Intelligence, Austin, Texas, July 30–August 3, 2000. 166 pages. Available at http://www.tcs.hut.fi/ ini/, 2000. |
|
|
93 | Timo Soininen, Ilkka Niemelä, Juha Tiihonen, and Reijo Sulonen. Unified configuration knowledge representation using weight constraint rules. Technical Report TKO-B149, Helsinki University of Technology, Laboratory of Information Processing Science, Helsinki, Finland, 2000. |
|
|
92 | Keijo Heljanko and Ilkka Niemelä. Petri net analysis and nonmonotonic reasoning. In Nisse Husberg, Tomi Janhunen, and Ilkka Niemelä, editors, Leksa Notes in Computer Science, Festschrift in Honour of Professor Leo Ojala, pages 7–19. Helsinki University of Technology, Laboratory for Theoretical Computer Science, 2000. |
|
1999 |
|
91 | 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. |
|
|
90 | 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. |
|
|
89 | 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. |
|
|
88 | 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. |
|
|
87 | 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. |
|
|
86 | 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. |
|
|
85 | 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. |
|
|
84 | 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. |
|
|
83 | 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. |
|
|
82 | 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. |
|
|
81 | 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. |
|
|
80 | 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. |
|
|
79 | 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. |
|
1998 |
|
78 | Tomi Janhunen. On the intertranslatability of autoepistemic, default and priority logics, and parallel circumscription. In Jürgen Dix, Luis Fariñas del Cerro, and Ulrich Furbach, editors, Proceedings of the 6th European Workshop on Logics in Artificial Intelligence, JELIA'98, pages 216–232, Dagstuhl, Germany, October 1998. Springer-Verlag. LNAI 1489. |
|
|
77 | Keijo Heljanko. Deadlock checking for complete finite prefixes using logic programs with stable model semantics (Extended abstract). In H.-D. Burkhard, L. Czaja, and P. Starke, editors, Proceedings of the Workshop Concurrency, Specification & Programming 1998, Informatik-Bericht Nr. 110, pages 106–115, Berlin, Germany, September 1998. Humboldt-University, Berlin. |
|
|
76 | Jürgen Dix, Ulrich Furbach, and Ilkka Niemelä. Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations. Fachbericht Informatik 20–98, Universität Koblenz-Landau, August 1998. Available at http://www.uni-koblenz.de/fb4/publikationen/gelbereihe/. |
|
|
75 | S. Brass, J. Dix, Ilkka Niemelä, and T.C. Przymusinski. A comparison of the static and the disjunctive well-founded semantics and its implementation. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning, pages 74–85, Trento, Italy, June 1998. Morgan Kaufmann Publishers. |
|
|
74 | Ilkka Niemelä and Torsten Schaub (Eds.). Proceedings of the workshop on computational aspects of nonmonotonic reasoning. Research Report A52, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, May 1998. |
|
|
73 | Ilkka Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. In Proceedings of the Workshop on Computational Aspects of Nonmonotonic Reasoning, pages 72–79. Helsinki University of Technology, Digital Systems Laboratory, Research Report A52, May 1998. |
|
|
72 | Tomi Janhunen. Non-monotonic systems: A framework for analyzing semantics and structural properties of NMR. Research Report A49, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, March 1998. Doctoral dissertation. |
|
|
71 | Ilkka Niemelä (Ed.). Proceedings of the HeCSE workshop on emerging technologies in distributed systems. Research Report A50, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, March 1998. |
|
|
70 | Tomi Janhunen. Non-Monotonic Systems: A Framework for Analyzing Semantics and Structural Properties of Non-Monotonic Reasoning. PhD thesis, Helsinki University of Technology, Department of Computer Science and Engineering, March 1998. |
|
|
69 | Timo Soininen and Ilkka Niemelä. Formalizing configuration knowledge using rules with choices. Technical Report TKO-B142, Helsinki University of Technology, Laboratory of Information Processing Science, 1998. Presented at the Workshop on Formal Aspects and Applications of Nonmonotonic Reasoning, May 31, 1998, Trento, Italy. |
|
|
68 | Gerd Brewka and Ilkka Niemelä. Report on the Seventh International Workshop on Nonmonotonic Reasoning. AI Magazine, 19(4):139, 1998. |
|
1997 |
|
67 | Patrik Simons. Towards constraint satisfaction through logic programs and the stable model semantics. Research Report A47, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, August 1997. |
|
|
66 | Ilkka Niemelä and P. Simons. Smodels – an implementation of the stable model and well-founded semantics for normal logic programs. In Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning, pages 420–429, Dagstuhl, Germany, July 1997. Springer-Verlag. |
|
|
65 | C. Aravindan, J. Dix, and Ilkka Niemelä. DisLoP: Towards a disjunctive logic programming system. In Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning, pages 341–352, Dagstuhl, Germany, July 1997. Springer-Verlag. |
|
|
64 | Tomi Janhunen. Separating disbeliefs from beliefs in autoepistemic reasoning. In Jürgen Dix, Ulrich Furbach, and Anil Nerode, editors, Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning, LPNMR'97, pages 132–151, Dagstuhl, Germany, July 1997. Springer-Verlag. LNAI 1265. |
|
|
63 | S. Brass, J. Dix, Ilkka Niemelä, and T.C. Przymusinski. Comparison and efficient computation of the static and the disjunctive WFS. In Proceedings of the Third Dutch-German Workshop on Nonmonotonic Reasoning, pages 37–42, Max Planck Institute for Computer Science, Saarbrücken, Germany, February 1997. |
|
|
62 | C. Aravindan, J. Dix, and Ilkka Niemelä. DisLoP: A Research Project on Disjunctive Logic Programming. Fachberichte Informatik 1–97, Universität Koblenz-Landau, 1997. Available at http://www.uni-koblenz.de/fb4/publikationen/gelbereihe/. |
|
|
61 | C. Aravindan, J. Dix, and Ilkka Niemelä. DisLoP: A research project on disjunctive logic programming. AI Communications, 10(3,4):151–165, 1997. |
|
|
60 | C. Aravindan, J. Dix, and Ilkka Niemelä. DisLoP: A research project on disjunctive logic programming. Computational Logic, 3(2), 1997. |
|
1996 |
|
59 | Jussi 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. |
|
|
58 | P. 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. |
|
|
57 | Ilkka 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. |
|
|
56 | C. 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. |
|
|
55 | C. 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. |
|
|
54 | Ilkka 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. |
|
|
53 | Tomi 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. |
|
|
52 | Tomi 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. |
|
|
51 | Ilkka 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. |
|
|
50 | Ilkka 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/. |
|
|
49 | Ilkka 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/. |
|
|
48 | Ilkka 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/. |
|
|
47 | P. 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/. |
|
|
46 | Ilkka 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. |
|
|
45 | S. 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/. |
|
1995 |
|
44 | Patrik Simons. Efficient implementation of the stable model semantics for normal logic programs. Research Report A35, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, September 1995. |
|
|
43 | Ilkka Niemelä. Towards efficient default reasoning. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, pages 312–318, Montreal, Canada, August 1995. Morgan Kaufmann Publishers. |
|
|
42 | Ilkka Niemelä and P. Simons. Evaluating an algorithm for default reasoning. In Working Notes of the IJCAI'95 Workshop on Applications and Implementations of Nonmonotonic Reasoning Systems, Montreal, Canada, pages 66–72, Montreal, Canada, August 1995. |
|
|
41 | Tomi Janhunen. Cautious models for general logic programs. In Hendrick Decker et al., editors, Proceedings of the Third International Workshop on Deductive Databases and Logic Programming, pages 25–39, Kanagawa, Japan, June 1995. Gesellschaft für Mathematik und Datenverarbeitung. GMD-Studien Nr. 266. |
|
|
40 | Ilkka Niemelä. A decision method for nonmonotonic reasoning based on autoepistemic reasoning. Journal of Automated Reasoning, 14:3–42, 1995. |
|
1994 |
|
39 | Tomi Janhunen. Investigations on cautious autoepistemic reasoning. Research Report A31, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, December 1994. |
|
|
38 | Ilkka Niemelä. A decision method for nonmonotonic reasoning based on autoepistemic reasoning. In Proceedings of the Fourth International Conference on Principles of Knowledge Representation and Reasoning, pages 473–484, Bonn, Germany, May 1994. Morgan Kaufmann Publishers. |
|
|
37 | Ilkka Niemelä. Autoepisteeminen logiikka epämonotonisen päättelyn pohjana. Tietojenkäsittelytiede, 6:15–25, 1994. |
|
|
36 | Ilkka Niemelä and J. Rintanen. On the impact of stratification on the complexity of nonmonotonic reasoning. In G. Lakemeyer and B. Nebel, editors, Foundations of Knowledge Representation and Reasoning, pages 275–295. Springer-Verlag, Berlin, 1994. |
|
|
35 | Ilkka Niemelä and Jussi Rintanen. On the impact of stratification on the complexity of nonmonotonic reasoning. Journal of Applied Non-Classical Logics, 4(2):141–179, 1994. |
|
|
34 | Ilkka Niemelä and Camilla Schwind. Proof systems for nonmonotonic logics. Lecture notes for a tutorial given at the 12th International Conference on Automated Deduction, Nancy, France, June 28–July 1, 1994. 44 pages., 1994. |
|
|
33 | Tomi Janhunen. Cautious autoepistemic reasoning applied to general logic programs. In Matti Penttonen, editor, Proceedings of the Seventh Finnish Symposium on Computer Science, pages 33–46, Liperi, Finland, January 1994. University of Joensuu, Department of Computer Science. (Report A-1994-1). |
|
1993 |
|
32 | Jussi Rintanen. Priorities and nonmonotonic reasoning. Research Report A28, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, December 1993. |
|
|
31 | Ilkka Niemelä. A decision method for nonmonotonic reasoning based on autoepistemic logic. In Automated Deduction in Nonstandard Logics — Papers from the 1993 Fall Symposium, pages 97–104, Raleigh, NC, USA, October 1993. AAAI Press. |
|
|
30 | Ilkka Niemelä. Autoepistemic logic as a unified basis for nonmonotonic reasoning. Research Report A24, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, August 1993. Doctoral dissertation. |
|
|
29 | Ilkka Niemelä. Autoepistemic Logic as a Unified Basis for Nonmonotonic Reasoning. PhD thesis, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, August 1993. |
|
|
28 | Tomi Janhunen and Ilkka Niemelä. A scheme for weakened negative introspection in autoepistemic reasoning. In Georg Gottlob, Alexander Leitsch, and Daniele Mundici, editors, Computational Logic and Proof Theory, Proceedings of the Third Kurt Gödel Colloquium, KGC'93, pages 211–222, Brno, Czech Republic, August 1993. Springer Verlag. LNCS 713. |
|
|
27 | Tomi Janhunen. Weakened negative introspection in autoepistemic reasoning. Research Report A21, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, February 1993. |
|
|
26 | Tomi Janhunen. Weakened negative introspection in autoepistemic reasoning. Series A: Research reports 21, Helsinki University of Technology, Digital Systems Laboratory, February 1993. Master's Thesis. |
|
|
25 | Ilkka Niemelä. Logiikka tietämyskielenä. In E. Hyvönen, I. Karanta, and M. Syrjänen, editors, Tekoälyn ensyklopedia, pages 116–124. Gaudeamus, 1993. |
|
|
24 | Tomi Janhunen. Weakened negative introspection in autoepistemic reasoning. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, January 1993. |
|
|
23 | Kimmo Varpaaniemi, Johannes Helander, Tomi Janhunen, Ismo Kangas, Kari Nurmela, Kenneth Oksanen, Olavi Pesonen, Marko Rauhamaa, James Reilly, Heikki Suonsivu, Kimmo Valkealahti, Pauli Väisänen, Peter Grönberg, Jaakko Halme, Kari Hiekkanen, Tino Pyssysalo, and Mikko Tiusanen. PROD 1.1 — A Pr/T reachability analysis tool.. http://www.tcs.hut.fi/Software/prod/, 1993. Computer Program. |
|
1992 |
|
22 | Jussi Rintanen. Stratification and tractability in nonmonotonic reasoning. Research Report A20, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, November 1992. |
|
|
21 | Ilkka Niemelä and J. Rintanen. On the impact of stratification on the complexity of nonmonotonic reasoning. In Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning, pages 627–638, Cambridge, MA, USA, October 1992. Morgan Kaufmann Publishers. |
|
|
20 | Ilkka Niemelä. A unifying framework for nonmonotonic reasoning. In Proceedings of the 10th European Conference on Artificial Intelligence, pages 334–338, Vienna, Austria, August 1992. John Wiley. |
|
|
19 | Ilkka Niemelä and J. Rintanen. A decision procedure for stratified autoepistemic logic. In Proceedings of the Finnish Artificial Intelligence Conference, pages 202–211, Espoo, Finland, June 1992. Finnish Artificial Intelligence Society. |
|
|
18 | Matti Hallivuori, Tomi Janhunen, and Tapio Suihko. A graphical user interface for a value added network. In Proceedings of the IFIP TC6 International Conference on Information Network and Data Communication, IV, pages 293–307, Espoo, Finland, March 1992. Elsevier Science Publishers B.V. |
|
|
17 | Ilkka Niemelä. Annual report for the year 1991. Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, 1992. |
|
|
16 | Ilkka Niemelä. On the decidability and complexity of autoepistemic reasoning. Fundamenta Informaticae, 17(1,2):117–155, 1992. |
|
|
15 | Ilkka Niemelä. Autoepistemic logic as a basis for automating nonmonotonic reasoning. Lecture Notes of the Summer School on Partial Semantics and Non-Monotonic Reasoning (Linköping, Sweden, May 25–29, 1992), 1992. |
|
1991 |
|
14 | Ilkka Niemelä. Constructive tightly grounded autoepistemic reasoning. In Proceedings of the 12th International Joint Conference on Artificial Intelligence, pages 399–404, Sydney, Australia, August 1991. Morgan Kaufmann Publishers. |
|
|
13 | Ilkka Niemelä. Annual report for the year 1990. Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, 1991. |
|
1990 |
|
12 | Ilkka Niemelä. Towards automatic autoepistemic reasoning. In Proceedings of the European Workshop on Logics in Artificial Intelligence—JELIA'90, pages 428–443, Amsterdam, The Netherlands, September 1990. Springer-Verlag. |
|
|
11 | Ilkka Niemelä. A new characterization of autoepistemic reasoning. In Proceedings of the Finnish Artificial Intelligence Symposium, pages 64–73, Oulu, Finland, June 1990. Finnish Artificial Intelligence Society. |
|
1989 |
|
10 | Ilkka Niemelä. Decision problem in autoepistemic logic. In Proceedings of the Workshop on Alternatives of Logic Programming, pages 174–188, Kuopio, Finland, May 1989. Kuopion yliopiston painatuskeskus. |
|
|
9 | Ilkka Niemelä. Automating Autoepistemic Reasoning. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science, Espoo, Finland, 1989. |
|
1988 |
|
8 | Ilkka Niemelä. On the complexity of the decision problem in propositional nonmonotonic logic. In Proceedings of the 2nd Workshop on Computer Science Logic, pages 226–239, Duisburg, FRG, October 1988. Springer-Verlag. |
|
|
7 | Ilkka Niemelä. Autoepistemic predicate logic. In Proceedings of the 8th European Conference on Artificial Intelligence, pages 595–600, München, August 1988. Pitman Publishing. |
|
|
6 | Ilkka Niemelä. Decision procedures for quantified non-monotonic logic. In Proceedings of the Finnish Artificial Intelligence Symposium, pages 418–427, Helsinki, Finland, August 1988. Limes ry. |
|
|
5 | Ilkka Niemelä. Decision procedure for autoepistemic logic. In Proceedings of the 9th International Conference on Automated Deduction, pages 675–684, Argonne, USA, May 1988. Springer-Verlag. |
|
1987 |
|
4 | Ilkka Niemelä and Heikki Tuominen. Helsinki logic machine: a system for logical expertise. Technical Report B1, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, December 1987. |
|
|
3 | Ilkka Niemelä. Nonmonotonic logic in knowledge-based systems. Master's Thesis (in Finnish), Helsinki University of Technology, Department of Electrical Engineering, 1987. |
|
1986 |
|
2 | Ilkka Niemelä and H. Tuominen. A system for logical expertise. In Proceedings of the Finnish Artificial Intelligence Symposium, Volume 2, pages 44–53, Espoo, Finland, August 1986. Finnish Society of Information Processing Science. |
|
|
1 | Ilkka Niemelä. A survey of nonmonotonic logic (in Finnish). Internal report A22, Helsinki University of Technology, Digital Systems Laboratory, Espoo, 1986. |
|
