2011 |
|
53 | 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. |
|
|
52 | 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. |
|
|
51 | 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. |
|
|
50 | 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. |
|
|
49 | 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. |
|
|
48 | 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. |
|
|
47 | 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. |
|
|
46 | 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 |
|
45 | 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. |
|
|
44 | 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. |
|
|
43 | 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. |
|
|
42 | 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. |
|
|
41 | 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. |
|
|
40 | 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. |
|
|
39 | 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. |
|
|
38 | 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 |
|
37 | 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. |
|
|
36 | 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. |
|
|
35 | 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. |
|
|
34 | 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. |
|
|
33 | 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. |
|
|
32 | 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. |
|
|
31 | 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. |
|
|
30 | 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. |
|
|
29 | 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. |
|
|
28 | 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. |
|
|
27 | 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. |
|
|
26 | 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. |
|
|
25 | 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. |
|
|
24 | Matti Järvisalo. Structure-based satisfiability checking: Analyzing and harnessing the potential. AI Communications, 22(2):117–119, 2009. Thesis summary. |
|
|
23 | Matti Järvisalo and Tommi Junttila. Limitations of restricted branching in clause learning. Constraints, 14(3):325–356, 2009. |
|
|
22 | Tomi Janhunen. lp2diff 1.23 — Translating logic programs into difference logic. http://www.tcs.hut.fi/Software/lp2diff/, 2009. Computer Program. |
|
2008 |
|
21 | 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. |
|
|
20 | 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. |
|
|
19 | 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. |
|
|
18 | 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. |
|
|
17 | 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. |
|
|
16 | 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. |
|
|
15 | 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. |
|
|
14 | 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. |
|
|
13 | 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. |
|
|
12 | 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. |
|
|
11 | 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. |
|
|
10 | 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. |
|
|
9 | 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. |
|
|
8 | Gerd Brewka, Ilkka Niemelä, and Mirosław Truszczyński. Preferences and nonmonotonic reasoning. AI Magazine, 29(4):69–78, 2008. |
|
|
7 | Ilkka Niemelä. Stable models and difference logic. Annals of Mathematics and Artificial Intelligence, 53(1–4):313–329, 2008. |
|
|
6 | 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. |
|
|
5 | 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. |
|
|
4 | 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. |
|
|
3 | 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. |
|
|
2 | 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. |
|
|
1 | 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. |
|
