Prioritized Autoepistemic Logic. - Jussi Rintanen (JELIA, 1994)

On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning. - Ilkka Niemelä; Jussi Rintanen (J. Appl. Non Class. Logics, 1994)

On Specificity in Default Logic. - Jussi Rintanen (IJCAI, 1995)

A Planning Algorithm not based on Directional Search. - Jussi Rintanen (KR, 1998)

Lexicographic Priorities in Default Logic. - Jussi Rintanen (Artif. Intell., 1998)

Complexity of Prioritized Default Logics. - Jussi Rintanen (J. Artif. Intell. Res., 1998)

Numeric State Variables in Constraint-Based Planning. - Jussi Rintanen; Hartmut Jungholt (ECP, 1999)

Improvements to the Evaluation of Quantified Boolean Formulae. - Jussi Rintanen (IJCAI, 1999)

Constructing Conditional Plans by a Theorem-Prover. - Jussi Rintanen (J. Artif. Intell. Res., 1999)

An Iterative Algorithm for Synthesizing Invariants. - Jussi Rintanen (AAAI/IAAI, 2000)

Incorporation of Temporal Logic Control into Plan Operators. - Jussi Rintanen (ECAI, 2000)

Complexity of Probabilistic Planning under Average Rewards. - Jussi Rintanen (IJCAI, 2001)

Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae. - Jussi Rintanen (LPAR, 2001)

An Overview of Recent Algorithms for AI Planning. - Jussi Rintanen; Jörg Hoffmann 001 (Künstliche Intell., 2001)

Backward Plan Construction for Planning with Partial Observability. - Jussi Rintanen (AIPS, 2002)

Symmetry Reduction for SAT Representations of Transition Systems. - Jussi Rintanen (ICAPS, 2003)

Expressive Equivalence of Formalisms for Planning with Sensing. - Jussi Rintanen (ICAPS, 2003)

Distance Estimates for Planning in the Discrete Belief Space. - Jussi Rintanen (AAAI, 2004)

Complexity of Planning with Partial Observability. - Jussi Rintanen (ICAPS, 2004)

Evaluation Strategies for Planning as Satisfiability. - Jussi Rintanen (ECAI, 2004)

Parallel Encodings of Classical Planning as Satisfiability. - Jussi Rintanen; Keijo Heljanko; Ilkka Niemelä (JELIA, 2004)

Phase Transitions in Classical Planning: An Experimental Study. - Jussi Rintanen (KR, 2004)

Satisfiability Planning with Constraints on the Number of Actions. - Markus Büttner; Jussi Rintanen (ICAPS, 2005)

Conditional Planning in the Discrete Belief Space. - Jussi Rintanen (IJCAI, 2005)

Constraints and AI Planning. - Alexander Nareyek; Eugene C. Freuder; Robert Fourer; Enrico Giunchiglia; Robert P. Goldman; Henry A. Kautz; Jussi Rintanen; Austin Tate (IEEE Intell. Syst., 2005)

Compact Representation of Sets of Binary Constraints. - Jussi Rintanen (ECAI, 2006)

Unified Definition of Heuristics for Classical Planning. - Jussi Rintanen (ECAI, 2006)

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

Diagnosis of Discrete-Event Systems Using Satisfiability Algorithms. - Alban Grastien; Anbulagan; Jussi Rintanen; Elena Kelareva (AAAI, 2007)

Asymptotically Optimal Encodings of Conformant Planning in QBF. - Jussi Rintanen (AAAI, 2007)

Complexity of Concurrent Temporal Planning. - Jussi Rintanen (ICAPS, 2007)

Planning as Satisfiability with Relaxed $-Step Plans. - Martin Wehrle; Jussi Rintanen (Australian Conference on Artificial Intelligence, 2007)

Planning via Petri Net Unfolding. - Sarah L. Hickmott; Jussi Rintanen; Sylvie Thiébaux; Langford B. White (IJCAI, 2007)

Planning for Temporally Extended Goals as Propositional Satisfiability. - Robert Mattmüller; Jussi Rintanen (IJCAI, 2007)

Diagnosers and Diagnosability of Succinct Transition Systems. - Jussi Rintanen (IJCAI, 2007)

Diagnosability Testing with Satisfiability Algorithms. - Jussi Rintanen; Alban Grastien (IJCAI, 2007)

Regression for Classical and Nondeterministic Planning. - Jussi Rintanen (ECAI, 2008)

A New Approach to Planning in Networks. - Jussi Rintanen (ECAI, 2008)

Planning Graphs and Propositional Clause-Learning. - Jussi Rintanen (KR, 2008)

Planning and SAT. - Jussi Rintanen (Handbook of Satisfiability, 2009)

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

Heuristics for Planning with SAT. - Jussi Rintanen (CP, 2010)

Planning with Specialized SAT Solvers. - Jussi Rintanen (AAAI, 2011)

Heuristics for Planning with SAT and Expressive Action Definitions. - Jussi Rintanen (ICAPS, 2011)

Planning with SAT, Admissible Heuristics and A*. - Jussi Rintanen (IJCAI, 2011)

Complexity of Conditional Planning under Partial Observability and Infinite Executions. - Jussi Rintanen (ECAI, 2012)

Engineering Efficient Planners with SAT. - Jussi Rintanen (ECAI, 2012)

Planning as satisfiability: Heuristics. - Jussi Rintanen (Artif. Intell., 2012)

Optimal Reconfiguration for Supply Restoration With Informed A* Search. - Adi Botea; Jussi Rintanen; Debdeep Banerjee (IEEE Trans. Smart Grid, 2012)

Scheduling with Contingent Resources and Tasks. - Jussi Rintanen (ICAPS, 2013)

Computing Upper Bounds on Lengths of Transition Sequences. - Jussi Rintanen; Charles Orgill Gretton (IJCAI, 2013)

Learning Chordal Markov Networks by Constraint Satisfaction. - Jukka Corander; Tomi Janhunen; Jussi Rintanen; Henrik J. Nyman; Johan Pensar (NIPS, 2013)

Answer Set Programming as SAT modulo Acyclicity. - Martin Gebser; Tomi Janhunen; Jussi Rintanen (ECAI, 2014)

SAT Modulo Graphs: Acyclicity. - Martin Gebser; Tomi Janhunen; Jussi Rintanen (JELIA, 2014)

Constraint-Based Algorithm for Computing Temporal Invariants. - Jussi Rintanen (JELIA, 2014)

ASP Encodings of Acyclicity Properties. - Martin Gebser; Tomi Janhunen; Jussi Rintanen (KR, 2014)

Discretization of Temporal Models with Application to Planning with SMT. - Jussi Rintanen (AAAI, 2015)

Impact of Modeling Languages on the Theory and Practice in Planning Research. - Jussi Rintanen (AAAI, 2015)

Models of Action Concurrency in Temporal Planning. - Jussi Rintanen (IJCAI, 2015)

Schematic Invariants by Reduction to Ground Invariants. - Jussi Rintanen (AAAI, 2017)

Temporal Planning with Clock-Based SMT Encodings. - Jussi Rintanen (IJCAI, 2017)

Learning discrete decomposable graphical models via constraint optimization. - Tomi Janhunen; Martin Gebser; Jussi Rintanen; Henrik J. Nyman; Johan Pensar; Jukka Corander (Stat. Comput., 2017)

Planning for Partial Observability by SAT and Graph Constraints. - Binda Pandey; Jussi Rintanen (ICAPS, 2018)

Declarative encodings of acyclicity properties. - Martin Gebser; Tomi Janhunen; Jussi Rintanen (J. Log. Comput., 2020)

Planning and SAT. - Jussi Rintanen (Handbook of Satisfiability, 2021)

Propositional Encodings of Acyclicity and Reachability by Using Vertex Elimination. - Masood Feyzbakhsh Rankooh; Jussi Rintanen (AAAI, 2022)

Efficient Encoding of Cost Optimal Delete-Free Planning as SAT. - Masood Feyzbakhsh Rankooh; Jussi Rintanen (AAAI, 2022)

Efficient Computation and Informative Estimation of h+ by Integer and Linear Programming. - Masood Feyzbakhsh Rankooh; Jussi Rintanen (ICAPS, 2022)

Generalized 3-Valued Belief States in Conformant Planning. - Saurabh Fadnis; Jussi Rintanen (PRICAI (1), 2022)

Planning with Complex Data Types in PDDL. - Mojtaba Elahi; Jussi Rintanen (CoRR, 2022)

Planning with Partial Observability by SAT. - Saurabh Fadnis; Jussi Rintanen (JELIA, 2023)

Optimizing the Optimization of Planning Domains by Automatic Action Schema Splitting. - Mojtaba Elahi; Jussi Rintanen (AAAI, 2024)

Symmetry-Breaking Constraints for Directed Graphs. - Jussi Rintanen; Masood Feyzbakhsh Rankooh (ECAI, 2024)

Termination Properties of Transition Rules for Indirect Effects. - Mojtaba Elahi; Saurabh Fadnis; Jussi Rintanen (ICAPS, 2024)