Jussi Rintanen

Jussi Rintanen: Planning as satisfiability: Heuristics. Artif. Intell. 193: 45-86 (2012)

Adi Botea, Jussi Rintanen, Debdeep Banerjee: Optimal Reconfiguration for Supply Restoration With Informed A^* Search. IEEE Trans. Smart Grid 3(2): 583-593 (2012)

Jussi Rintanen: Complexity of Conditional Planning under Partial Observability and Infinite Executions. ECAI 2012: 678-683

Jussi Rintanen: Engineering Efficient Planners with SAT. ECAI 2012: 684-689

Jussi Rintanen: Planning with Specialized SAT Solvers. AAAI 2011

Jussi Rintanen: Heuristics for Planning with SAT and Expressive Action Definitions. ICAPS 2011

Jussi Rintanen: Planning with SAT, Admissible Heuristics and A*. IJCAI 2011: 2015-2020

Jussi Rintanen: Complexity of Prioritized Default Logics. CoRR abs/1105.5453 (2011)

Jussi Rintanen: Constructing Conditional Plans by a Theorem-Prover. CoRR abs/1105.5465 (2011)

Jussi Rintanen: Heuristic Planning with SAT: Beyond Uninformed Depth-First Search. Australasian Conference on Artificial Intelligence 2010: 415-424

Jussi Rintanen: Heuristics for Planning with SAT. CP 2010: 414-428

Jussi Rintanen: Planning and SAT. Handbook of Satisfiability 2009: 483-504

Jussi Rintanen: Regression for Classical and Nondeterministic Planning. ECAI 2008: 568-572

Jussi Rintanen: A New Approach to Planning in Networks. ECAI 2008: 917-918

Jussi Rintanen: Planning Graphs and Propositional Clause-Learning. KR 2008: 535-543

Jussi Rintanen, Bernhard Nebel, J. Christopher Beck, Eric A. Hansen (Eds.): Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, ICAPS 2008, Sydney, Australia, September 14-18, 2008. AAAI 2008, isbn 978-1-57735-386-7

Alban Grastien, Anbulagan, Jussi Rintanen, Elena Kelareva: Diagnosis of Discrete-Event Systems Using Satisfiability Algorithms. AAAI 2007: 305-310

Jussi Rintanen: Asymptotically Optimal Encodings of Conformant Planning in QBF. AAAI 2007: 1045-1050

Jussi Rintanen: Complexity of Concurrent Temporal Planning. ICAPS 2007: 280-287

Martin Wehrle, Jussi Rintanen: Planning as Satisfiability with Relaxed $-Step Plans. Australian Conference on Artificial Intelligence 2007: 244-253

Jussi Rintanen, Alban Grastien: Diagnosability Testing with Satisfiability Algorithms. IJCAI 2007: 532-537

Jussi Rintanen: Diagnosers and Diagnosability of Succinct Transition Systems. IJCAI 2007: 538-544

Sarah L. Hickmott, Jussi Rintanen, Sylvie Thiébaux, Langford B. White: Planning via Petri Net Unfolding. IJCAI 2007: 1904-1911

Robert Mattmüller, Jussi Rintanen: Planning for Temporally Extended Goals as Propositional Satisfiability. IJCAI 2007: 1966-

Jussi Rintanen, Keijo Heljanko, Ilkka Niemelä: Planning as satisfiability: parallel plans and algorithms for plan search. Artif. Intell. 170(12-13): 1031-1080 (2006)

Jussi Rintanen: Compact Representation of Sets of Binary Constraints. ECAI 2006: 143-147

Jussi Rintanen: Unified Definition of Heuristics for Classical Planning. ECAI 2006: 600-

Alexander Nareyek, Eugene C. Freuder, Robert Fourer, Enrico Giunchiglia, Robert P. Goldman, Henry A. Kautz, Jussi Rintanen, Austin Tate: Constraints and AI Planning. IEEE Intelligent Systems 20(2): 62-72 (2005)

Markus Büttner, Jussi Rintanen: Satisfiability Planning with Constraints on the Number of Actions. ICAPS 2005: 292-299

Jussi Rintanen: Conditional Planning in the Discrete Belief Space. IJCAI 2005: 1260-1265

Jussi Rintanen: Distance Estimates for Planning in the Discrete Belief Space. AAAI 2004: 525-530

Jussi Rintanen: Phase Transitions in Classical Planning: An Experimental Study. ICAPS 2004: 101-110

Jussi Rintanen: Complexity of Planning with Partial Observability. ICAPS 2004: 345-354

Jussi Rintanen: Evaluation Strategies for Planning as Satisfiability. ECAI 2004: 682-687

Jussi Rintanen, Keijo Heljanko, Ilkka Niemelä: Parallel Encodings of Classical Planning as Satisfiability. JELIA 2004: 307-319

Jussi Rintanen: Phase Transitions in Classical Planning: An Experimental Study. KR 2004: 710-719

Jussi Rintanen: Symmetry Reduction for SAT Representations of Transition Systems. ICAPS 2003: 32-41

Jussi Rintanen: Expressive Equivalence of Formalisms for Planning with Sensing. ICAPS 2003: 185-194

Jussi Rintanen: Backward Plan Construction for Planning with Partial Observability. AIPS 2002: 173-183

Jussi Rintanen, Jörg Hoffmann: An Overview of Recent Algorithms for AI Planning. KI 15(2): 5-11 (2001)

Jussi Rintanen: Complexity of Probabilistic Planning under Average Rewards. IJCAI 2001: 503-508

Jussi Rintanen: Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae. LPAR 2001: 362-376

Jussi Rintanen: An Iterative Algorithm for Synthesizing Invariants. AAAI/IAAI 2000: 806-811

Jussi Rintanen: Incorporation of Temporal Logic Control into Plan Operators. ECAI 2000: 526-530

Jussi Rintanen: Constructing Conditional Plans by a Theorem-Prover. J. Artif. Intell. Res. (JAIR) 10: 323-352 (1999)

Jussi Rintanen, Hartmut Jungholt: Numeric State Variables in Constraint-Based Planning. ECP 1999: 109-121

Jussi Rintanen: Improvements to the Evaluation of Quantified Boolean Formulae. IJCAI 1999: 1192-1197

Jussi Rintanen: Lexicographic Priorities in Default Logic. Artif. Intell. 106(2): 221-265 (1998)

Jussi Rintanen: Complexity of Prioritized Default Logics. J. Artif. Intell. Res. (JAIR) 9: 423-461 (1998)

Jussi Rintanen: A Planning Algorithm not based on Directional Search. KR 1998: 617-625

Jussi Rintanen: On Specificity in Default Logic. IJCAI 1995: 1474-1479

Ilkka Niemelä, Jussi Rintanen: On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning. Journal of Applied Non-Classical Logics 4(2): 141-179 (1994)

Jussi Rintanen: Prioritized Autoepistemic Logic. JELIA 1994: 232-246

Ilkka Niemelä, Jussi Rintanen: On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning. ECAI Workshop on Knowledge Representation and Reasoning 1992: 275-295

Ilkka Niemelä, Jussi Rintanen: On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning. KR 1992: 627-638