2012 |
|
174 | Guohua Liu, Tomi Janhunen, and Ilkka Niemelä. Answer set programming via mixed integer programming. In Thomas Eiter and Sheila McIlraith, editors, Proceedings of the 13th International Conference on Principles of Knowledge Representation and Reasoning (KR), pages 32–42, Rome, Italy, June 2012. AAAI Press. |
|
|
173 | 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. |
|
|
172 | 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. |
|
|
171 | 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. |
|
|
170 | 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. |
|
|
169 | 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. |
|
|
168 | 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. |
|
|
167 | 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. |
|
|
166 | 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. |
|
2011 |
|
165 | 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. |
|
|
164 | 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 Design, ACSD 2011, pages 185–194. IEEE Computer Society, June 2011. |
|
|
163 | Guohua Liu, Randy Goebel, Tomi Janhunen, Ilkka Niemelä, and Jia-Huai You. Strong equivalence of logic programs with abstract constraint atoms. 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 161–173, Vancouver, British Columbia, Canada, May 2011. Springer. |
|
|
162 | 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. |
|
|
161 | 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. |
|
|
160 | 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. |
|
|
159 | 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. |
|
|
158 | 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. |
|
|
157 | 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. |
|
|
156 | 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. |
|
|
155 | 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. |
|
2010 |
|
154 | 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. |
|
|
153 | 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. |
|
|
152 | Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Partitioning SAT instances for distributed solving. In Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2010, volume 6397 of Lecture Notes in Computer Science, pages 372–386, 2010. |
|
|
151 | Kari Kähkönen, Roland Kindermann, Keijo Heljanko, and Ilkka Niemelä. Experimental comparison of concolic and random testing for java card applets. In Proceedings of the 16th International SPIN Workshop on Model Checking of Software SPIN 2010, volume 6349 of Lecture Notes in Computer Science, pages 22–39, 2010. |
|
|
150 | Tero Laitinen, Tommi Junttila, and Ilkka Niemelä. Extending clause learning DPLL with parity reasoning. In Proceedings of the 19th European Conference on Artificial Intelligence, ECAI 2010, volume 215 of Frontiers in Artificial Intelligence and Applications, pages 21–26. IOS Press, 2010. |
|
|
149 | Tomi Janhunen, Ilkka Niemelä, Johannes Oetsch, Jörg Pührer, and Hans Tompits. On testing answer-set programs. In Proceedings of the 19th European Conference on Artificial Intelligence, ECAI 2010, volume 215 of Frontiers in Artificial Intelligence and Applications, pages 951–956. IOS Press, 2010. |
|
|
148 | Tomi Janhunen and Ilkka Niemelä, editors. Logics in Artificial Intelligence, 12th European Conference, JELIA 2010, Helsinki, Finland, September 2010, Proceedings, volume 6341 of Lecture Notes in Artificial Intelligence. Springer, 2010. |
|
|
147 | Janne Valkonen and Ilkka Niemelä. Turvallisuuskriittisten järjestelmien verifiointi mallintarkastuksella. ATS Ydintekniikka, 39(1):6–8, 2010. |
|
|
146 | 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. |
|
|
145 | 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. |
|
2009 |
|
144 | 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. |
|
|
143 | 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. |
|
|
142 | 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. |
|
|
141 | 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. |
|
|
140 | 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. |
|
|
139 | Antti 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. |
|
|
138 | Tomi Janhunen, Ilkka Niemelä, and Mark Sevalnev. Computing stable models via reductions to difference logic. In Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2009, volume 5753 of Lecture Notes in Computer Science, pages 142–154, 2009. |
|
|
137 | Matti Järvisalo, Emilia Oikarinen, Tomi Janhunen, and Ilkka Niemelä. A module-based framework for multi-language constraint modeling. In Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2009, volume 5753 of Lecture Notes in Computer Science, pages 155–168, 2009. |
|
|
136 | 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. |
|
|
135 | Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Partitioning search spaces of a randomized search. In Proceedings of the 11th Conference of the Italian Association for Artificial Intelligence, AI*IA 2009, volume 5883 of Lecture Notes in Computer Science, pages 243–252, 2009. |
|
|
134 | Kari Kähkönen, Jani Lampinen, Keijo Heljanko, and Ilkka Niemelä. The LIME interface specification language and runtime monitoring tool. In Proceedings of the 9th International Workshop on Runtime Verification, RV2009, volume 5779 of Lecture Notes in Computer Science, pages 93–100, 2009. |
|
2008 |
|
133 | 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. |
|
|
132 | 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. |
|
|
131 | 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. |
|
|
130 | 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. |
|
|
129 | 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. |
|
|
128 | 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: Algorithms in Cognition, Informatics, and Logic, 63(1–3):90–113, 2008. |
|
|
127 | Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä. Justification-based non-clausal local search for SAT. In Proceedings of the 18th European Conference on Artificial Intelligence (ECAI 2008), pages 535–539. IOS Press, 2008. |
|
|
126 | Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Strategies for solving SAT in Grids by randomized search. In Proceedings of the 9th Conference on Artificial Intelligence and Symbolic Computation (AISC 2008), volume 5144 of Lecture Notes in Artificial Intelligence, pages 125–140. Springer, 2008. |
|
|
125 | Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Incorporating learning in grid-based randomized SAT solving. In Proceedings of the 13th International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA 2008), volume 5253 of Lecture Notes in Artificial Intelligence, pages 247–261. Springer, 2008. |
|
|
124 | 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. |
|
|
123 | 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. |
|
|
122 | 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. |
|
|
121 | 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. |
|
|
120 | Gerd Brewka, Ilkka Niemelä, and Mirosław Truszczyński. Preferences and nonmonotonic reasoning. AI Magazine, 29(4):69–78, 2008. |
|
|
119 | Ilkka Niemelä. Stable models and difference logic. Annals of Mathematics and Artificial Intelligence, 53(1–4):313–329, 2008. |
|
2007 |
|
118 | 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. |
|
2006 |
|
117 | 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(2):1–37, 2006. |
|
|
116 | 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:27–64, 2006. |
|
|
115 | 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, Proceedings of the 9th International Conference on Theory and Applications of Satisfiability Testing (SAT 2006), volume 4121 of Lecture Notes in Computer Science, pages 430–435. Springer, 2006. |
|
|
114 | 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. |
|
|
113 | 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. |
|
|
112 | 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. |
|
2005 |
|
111 | 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. |
|
|
110 | 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. |
|
|
109 | 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. |
|
|
108 | 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 Artificial Intelligence, pages 134–148. Springer-Verlag, 2005. |
|
|
107 | 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. |
|
|
106 | 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. |
|
2004 |
|
105 | Jussi Rintanen, Keijo Heljanko, and Ilkka Niemelä. Parallel encodings of classical planning as satisfiability. In Proceedings of the 9th European Conference on Logics in Artificial Intelligence (JELIA'04), Lecture Notes in Artificial Intelligence 3229, pages 307–319, Lisbon, Portugal, September 2004. Springer. |
|
|
104 | Matti Järvisalo and Ilkka Niemelä. A compact reformulation of propositional satisfiability as binary constraint satisfaction. In Proceedings of the Third International Workshop on Modelling and Reformulating Constraint Satisfaction Problems: Towards Systemisation and Automation, September 2004. |
|
|
103 | 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. |
|
|
102 | 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. |
|
|
101 | Tomi Janhunen, Ilkka Niemelä, Dietmar Seipel, Patrik Simons, and Jia-Huai You. Unfolding partiality and disjunctions in stable model semantics. CoRR: cs.AI/0303009 v2, January 2004. Submitted for publication. |
|
|
100 | 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. |
|
|
99 | 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. |
|
|
98 | Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä. Unrestricted vs restricted cut in a tableau method for Boolean circuits. In AI&M 2004, 8th International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, Florida, USA, January 4–6 2004. |
|
|
97 | 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. |
|
|
96 | Gerhard Brewka, Ilkka Niemelä, and Tommi Syrjänen. Logic programs with ordered disjunction. Computational Intelligence, 20(2):333–357, 2004. |
|
2003 |
|
95 | 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. |
|
|
94 | 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. |
|
|
93 | Toni Jussila, Keijo Heljanko, and Ilkka Niemelä. BMC via on-the-fly determinization. In Proceedings of the first International Workshop on Bounded Model Checking, volume 89 of ENTCS, Boulder, Colorado, USA, July 2003. Elsevier. |
|
|
92 | 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. |
|
|
91 | 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). |
|
|
90 | 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. |
|
2002 |
|
89 | 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. |
|
|
88 | 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. |
|
|
87 | Patrik Simons, Ilkka Niemelä, and Timo Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138(1–2):181–234, 2002. |
|
|
86 | 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. |
|
2001 |
|
85 | Keijo Heljanko and Ilkka Niemelä. Bounded LTL model checking with stable models. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 200–212, Vienna, Austria, September 2001. Springer-Verlag. |
|
|
84 | Tommi Syrjänen and Ilkka Niemelä. The Smodels systems. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 434–438, Vienna, Austria, September 2001. Springer-Verlag. |
|
|
83 | 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. |
|
|
82 | 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. |
|
|
81 | 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. |
|
|
80 | 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. |
|
2000 |
|
79 | Nisse Husberg, Tomi Janhunen, and Ilkka Niemelä (Eds.). Leksa Notes in Computer Science, festschrift in honour of professor Leo Ojala. Research Report A63, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, October 2000. |
|
|
78 | 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. |
|
|
77 | Tommi Junttila and Ilkka Niemelä. Towards an efficient tableau method for Boolean circuit satisfiability checking. In Proceedings of the First International Conference on Computational Logic, Automated Deduction: Putting Theory into Practice, pages 553–567, London, U.K., July 2000. Springer-Verlag. |
|
|
76 | Tomi Janhunen, Ilkka Niemelä, Patrik Simons, and Jia-Huai You. Unfolding partiality and disjunctions in stable model semantics. In A.G. Cohn, F. Guinchiglia, and B. Selman, editors, Proceedings of the Seventh International Conference on Principles of Knowledge Representation and Reasoning, pages 411–419, Breckenridge, Colorado, USA, April 2000. Morgan Kaufmann Publishers. |
|
|
75 | 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. |
|
|
74 | 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. |
|
|
73 | 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. |
|
|
72 | 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. |
|
|
71 | 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. |
|
|
70 | 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. |
|
|
69 | 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 |
|
68 | 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. |
|
|
67 | 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. |
|
|
66 | 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. |
|
|
65 | 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. |
|
|
64 | 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. |
|
|
63 | 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. |
|
|
62 | 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. |
|
1998 |
|
61 | 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/. |
|
|
60 | 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. |
|
|
59 | 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. |
|
|
58 | 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. |
|
|
57 | 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. |
|
|
56 | Gerd Brewka and Ilkka Niemelä. Report on the Seventh International Workshop on Nonmonotonic Reasoning. AI Magazine, 19(4):139, 1998. |
|
1997 |
|
55 | 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. |
|
|
54 | 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. |
|
|
53 | 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. |
|
|
52 | 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/. |
|
|
51 | C. Aravindan, J. Dix, and Ilkka Niemelä. DisLoP: A research project on disjunctive logic programming. AI Communications, 10(3,4):151–165, 1997. |
|
|
50 | C. Aravindan, J. Dix, and Ilkka Niemelä. DisLoP: A research project on disjunctive logic programming. Computational Logic, 3(2), 1997. |
|
1996 |
|
49 | 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. |
|
|
48 | 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. |
|
|
47 | 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. |
|
|
46 | 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. |
|
|
45 | 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. |
|
|
44 | 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. |
|
|
43 | 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/. |
|
|
42 | 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/. |
|
|
41 | 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/. |
|
|
40 | 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/. |
|
|
39 | 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. |
|
|
38 | 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 |
|
37 | 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. |
|
|
36 | 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. |
|
|
35 | Ilkka Niemelä. Annual report for the year 1994. Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, 1995. |
|
|
34 | Ilkka Niemelä. A decision method for nonmonotonic reasoning based on autoepistemic reasoning. Journal of Automated Reasoning, 14:3–42, 1995. |
|
1994 |
|
33 | 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. |
|
|
32 | Ilkka Niemelä. Annual report for the year 1993. Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, 1994. |
|
|
31 | Ilkka Niemelä. Autoepisteeminen logiikka epämonotonisen päättelyn pohjana. Tietojenkäsittelytiede, 6:15–25, 1994. |
|
|
30 | 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. |
|
|
29 | 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. |
|
|
28 | 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. |
|
1993 |
|
27 | 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. |
|
|
26 | T. Janhunen and Ilkka Niemelä. A scheme for weakened negative introspection in autoepistemic reasoning. In Proceedings of the 3rd Kurt Gödel Colloquium on Computational Logic and Proof Theory, pages 211–222, Brno, Czech Republic, August 1993. Springer-Verlag. |
|
|
25 | Ilkka Niemelä. Autoepistemic logic as a unified basis for nonmonotonic reasoning. Doctoral dissertation. Research report A24, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, August 1993. |
|
|
24 | Ilkka Niemelä. Autoepistemic Logic as a Unified Basis for Nonmonotonic Reasoning. PhD thesis, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, August 1993. |
|
|
23 | Ilkka Niemelä. Logiikka tietämyskielenä. In E. Hyvönen, I. Karanta, and M. Syrjänen, editors, Tekoälyn ensyklopedia, pages 116–124. Gaudeamus, 1993. |
|
1992 |
|
22 | 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. |
|
|
21 | 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. |
|
|
20 | 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. |
|
|
19 | Ilkka Niemelä. Annual report for the year 1991. Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, 1992. |
|
|
18 | Ilkka Niemelä. On the decidability and complexity of autoepistemic reasoning. Fundamenta Informaticae, 17(1,2):117–155, 1992. |
|
|
17 | 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 |
|
16 | 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. |
|
|
15 | Ilkka Niemelä. Annual report for the year 1990. Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, 1991. |
|
1990 |
|
14 | 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. |
|
|
13 | 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. |
|
|
12 | Ilkka Niemelä. Annual report for the year 1989. Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, 1990. |
|
1989 |
|
11 | 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. |
|
|
10 | Ilkka Niemelä. Automating Autoepistemic Reasoning. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science, Espoo, Finland, 1989. |
|
|
9 | Ilkka Niemelä. Annual report for the year 1988. Helsinki University of Technology, Digital Systems Laboratory, 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 H. 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. |
|
