default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJussi Rintanen
Person information
- affiliation: Aalto University, Helsinki, Finland
- affiliation (former): Australian National University, Acton, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c63]Mojtaba Elahi, Jussi Rintanen:
Optimizing the Optimization of Planning Domains by Automatic Action Schema Splitting. AAAI 2024: 20096-20103- [c62]Jussi Rintanen, Masood Feyzbakhsh Rankooh:
Symmetry-Breaking Constraints for Directed Graphs. ECAI 2024: 4248-4253 - [c61]Mojtaba Elahi, Saurabh Fadnis, Jussi Rintanen:
Termination Properties of Transition Rules for Indirect Effects. ICAPS 2024: 178-186 - 2023
- [c60]Saurabh Fadnis
, Jussi Rintanen:
Planning with Partial Observability by SAT. JELIA 2023: 605-620 - 2022
- [c59]Masood Feyzbakhsh Rankooh, Jussi Rintanen:
Propositional Encodings of Acyclicity and Reachability by Using Vertex Elimination. AAAI 2022: 5861-5868 - [c58]Masood Feyzbakhsh Rankooh, Jussi Rintanen:
Efficient Encoding of Cost Optimal Delete-Free Planning as SAT. AAAI 2022: 9910-9917 - [c57]Masood Feyzbakhsh Rankooh, Jussi Rintanen:
Efficient Computation and Informative Estimation of h+ by Integer and Linear Programming. ICAPS 2022: 71-79 - [c56]Saurabh Fadnis, Jussi Rintanen:
Generalized 3-Valued Belief States in Conformant Planning. PRICAI (1) 2022: 104-117 - [i5]Mojtaba Elahi, Jussi Rintanen:
Planning with Complex Data Types in PDDL. CoRR abs/2212.14462 (2022) - 2021
- [p2]Jussi Rintanen:
Planning and SAT. Handbook of Satisfiability 2021: 765-789 - [i4]Masood Feyzbakhsh Rankooh, Jussi Rintanen:
Propositional Encodings of Acyclicity and Reachability by using Vertex Elimination. CoRR abs/2105.12908 (2021) - 2020
- [j11]Martin Gebser, Tomi Janhunen, Jussi Rintanen:
Declarative encodings of acyclicity properties. J. Log. Comput. 30(4): 923-952 (2020)
2010 – 2019
- 2018
- [c55]Binda Pandey, Jussi Rintanen:
Planning for Partial Observability by SAT and Graph Constraints. ICAPS 2018: 190-198 - 2017
- [j10]Tomi Janhunen, Martin Gebser, Jussi Rintanen, Henrik J. Nyman, Johan Pensar, Jukka Corander:
Learning discrete decomposable graphical models via constraint optimization. Stat. Comput. 27(1): 115-130 (2017) - [c54]Jussi Rintanen:
Schematic Invariants by Reduction to Ground Invariants. AAAI 2017: 3644-3650 - [c53]Jussi Rintanen:
Temporal Planning with Clock-Based SMT Encodings. IJCAI 2017: 743-749 - 2015
- [c52]Jussi Rintanen:
Discretization of Temporal Models with Application to Planning with SMT. AAAI 2015: 3349-3355 - [c51]Jussi Rintanen:
Impact of Modeling Languages on the Theory and Practice in Planning Research. AAAI 2015: 4052-4056 - [c50]Jussi Rintanen:
Models of Action Concurrency in Temporal Planning. IJCAI 2015: 1659-1665 - 2014
- [c49]Martin Gebser, Tomi Janhunen, Jussi Rintanen:
Answer Set Programming as SAT modulo Acyclicity. ECAI 2014: 351-356 - [c48]Martin Gebser, Tomi Janhunen, Jussi Rintanen:
SAT Modulo Graphs: Acyclicity. JELIA 2014: 137-151 - [c47]Jussi Rintanen:
Constraint-Based Algorithm for Computing Temporal Invariants. JELIA 2014: 665-673 - [c46]Martin Gebser, Tomi Janhunen, Jussi Rintanen:
ASP Encodings of Acyclicity Properties. KR 2014 - 2013
- [c45]Jussi Rintanen:
Scheduling with Contingent Resources and Tasks. ICAPS 2013 - [c44]Jussi Rintanen, Charles Orgill Gretton:
Computing Upper Bounds on Lengths of Transition Sequences. IJCAI 2013: 2365-2372 - [c43]Jukka Corander, Tomi Janhunen, Jussi Rintanen, Henrik J. Nyman, Johan Pensar:
Learning Chordal Markov Networks by Constraint Satisfaction. NIPS 2013: 1349-1357 - [i3]Jukka Corander, Tomi Janhunen, Jussi Rintanen, Henrik J. Nyman, Johan Pensar:
Learning Chordal Markov Networks by Constraint Satisfaction. CoRR abs/1310.0927 (2013) - 2012
- [j9]Jussi Rintanen:
Planning as satisfiability: Heuristics. Artif. Intell. 193: 45-86 (2012) - [j8]Adi Botea, Jussi Rintanen, Debdeep Banerjee:
Optimal Reconfiguration for Supply Restoration With Informed A* Search. IEEE Trans. Smart Grid 3(2): 583-593 (2012) - [c42]Jussi Rintanen:
Complexity of Conditional Planning under Partial Observability and Infinite Executions. ECAI 2012: 678-683 - [c41]Jussi Rintanen:
Engineering Efficient Planners with SAT. ECAI 2012: 684-689 - 2011
- [c40]Jussi Rintanen:
Planning with Specialized SAT Solvers. AAAI 2011: 1563-1566 - [c39]Jussi Rintanen:
Heuristics for Planning with SAT and Expressive Action Definitions. ICAPS 2011 - [c38]Jussi Rintanen:
Planning with SAT, Admissible Heuristics and A*. IJCAI 2011: 2015-2020 - [i2]Jussi Rintanen:
Complexity of Prioritized Default Logics. CoRR abs/1105.5453 (2011) - [i1]Jussi Rintanen:
Constructing Conditional Plans by a Theorem-Prover. CoRR abs/1105.5465 (2011) - 2010
- [c37]Jussi Rintanen:
Heuristic Planning with SAT: Beyond Uninformed Depth-First Search. Australasian Conference on Artificial Intelligence 2010: 415-424 - [c36]Jussi Rintanen:
Heuristics for Planning with SAT. CP 2010: 414-428
2000 – 2009
- 2009
- [p1]Jussi Rintanen:
Planning and SAT. Handbook of Satisfiability 2009: 483-504 - 2008
- [c35]Jussi Rintanen:
Regression for Classical and Nondeterministic Planning. ECAI 2008: 568-572 - [c34]Jussi Rintanen:
A New Approach to Planning in Networks. ECAI 2008: 917-918 - [c33]Jussi Rintanen:
Planning Graphs and Propositional Clause-Learning. KR 2008: 535-543 - [e1]Jussi Rintanen, Bernhard Nebel, J. Christopher Beck, Eric A. Hansen:
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 [contents] - 2007
- [c32]Alban Grastien, Anbulagan, Jussi Rintanen, Elena Kelareva:
Diagnosis of Discrete-Event Systems Using Satisfiability Algorithms. AAAI 2007: 305-310 - [c31]Jussi Rintanen:
Asymptotically Optimal Encodings of Conformant Planning in QBF. AAAI 2007: 1045-1050 - [c30]Jussi Rintanen:
Complexity of Concurrent Temporal Planning. ICAPS 2007: 280-287 - [c29]Martin Wehrle, Jussi Rintanen:
Planning as Satisfiability with Relaxed $-Step Plans. Australian Conference on Artificial Intelligence 2007: 244-253 - [c28]Jussi Rintanen, Alban Grastien:
Diagnosability Testing with Satisfiability Algorithms. IJCAI 2007: 532-537 - [c27]Jussi Rintanen:
Diagnosers and Diagnosability of Succinct Transition Systems. IJCAI 2007: 538-544 - [c26]Sarah L. Hickmott, Jussi Rintanen, Sylvie Thiébaux, Langford B. White:
Planning via Petri Net Unfolding. IJCAI 2007: 1904-1911 - [c25]Robert Mattmüller, Jussi Rintanen:
Planning for Temporally Extended Goals as Propositional Satisfiability. IJCAI 2007: 1966- - 2006
- [j7]Jussi Rintanen, Keijo Heljanko, Ilkka Niemelä:
Planning as satisfiability: parallel plans and algorithms for plan search. Artif. Intell. 170(12-13): 1031-1080 (2006) - [c24]Jussi Rintanen:
Compact Representation of Sets of Binary Constraints. ECAI 2006: 143-147 - [c23]Jussi Rintanen:
Unified Definition of Heuristics for Classical Planning. ECAI 2006: 600- - 2005
- [j6]Alexander Nareyek, Eugene C. Freuder, Robert Fourer, Enrico Giunchiglia, Robert P. Goldman, Henry A. Kautz, Jussi Rintanen, Austin Tate:
Constraints and AI Planning. IEEE Intell. Syst. 20(2): 62-72 (2005) - [c22]Markus Büttner, Jussi Rintanen:
Satisfiability Planning with Constraints on the Number of Actions. ICAPS 2005: 292-299 - [c21]Jussi Rintanen:
Conditional Planning in the Discrete Belief Space. IJCAI 2005: 1260-1265 - 2004
- [c20]Jussi Rintanen:
Distance Estimates for Planning in the Discrete Belief Space. AAAI 2004: 525-530 - [c19]Jussi Rintanen:
Phase Transitions in Classical Planning: An Experimental Study. ICAPS 2004: 101-110 - [c18]Jussi Rintanen:
Complexity of Planning with Partial Observability. ICAPS 2004: 345-354 - [c17]Jussi Rintanen:
Evaluation Strategies for Planning as Satisfiability. ECAI 2004: 682-687 - [c16]Jussi Rintanen, Keijo Heljanko, Ilkka Niemelä:
Parallel Encodings of Classical Planning as Satisfiability. JELIA 2004: 307-319 - [c15]Jussi Rintanen:
Phase Transitions in Classical Planning: An Experimental Study. KR 2004: 710-719 - 2003
- [c14]Jussi Rintanen:
Symmetry Reduction for SAT Representations of Transition Systems. ICAPS 2003: 32-41 - [c13]Jussi Rintanen:
Expressive Equivalence of Formalisms for Planning with Sensing. ICAPS 2003: 185-194 - 2002
- [c12]Jussi Rintanen:
Backward Plan Construction for Planning with Partial Observability. AIPS 2002: 173-183 - 2001
- [j5]Jussi Rintanen, Jörg Hoffmann:
An Overview of Recent Algorithms for AI Planning. Künstliche Intell. 15(2): 5-11 (2001) - [c11]Jussi Rintanen:
Complexity of Probabilistic Planning under Average Rewards. IJCAI 2001: 503-508 - [c10]Jussi Rintanen:
Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae. LPAR 2001: 362-376 - 2000
- [c9]Jussi Rintanen:
An Iterative Algorithm for Synthesizing Invariants. AAAI/IAAI 2000: 806-811 - [c8]Jussi Rintanen:
Incorporation of Temporal Logic Control into Plan Operators. ECAI 2000: 526-530
1990 – 1999
- 1999
- [j4]Jussi Rintanen:
Constructing Conditional Plans by a Theorem-Prover. J. Artif. Intell. Res. 10: 323-352 (1999) - [c7]Jussi Rintanen, Hartmut Jungholt:
Numeric State Variables in Constraint-Based Planning. ECP 1999: 109-121 - [c6]Jussi Rintanen:
Improvements to the Evaluation of Quantified Boolean Formulae. IJCAI 1999: 1192-1197 - 1998
- [j3]Jussi Rintanen:
Lexicographic Priorities in Default Logic. Artif. Intell. 106(2): 221-265 (1998) - [j2]Jussi Rintanen:
Complexity of Prioritized Default Logics. J. Artif. Intell. Res. 9: 423-461 (1998) - [c5]Jussi Rintanen:
A Planning Algorithm not based on Directional Search. KR 1998: 617-625 - 1995
- [c4]Jussi Rintanen:
On Specificity in Default Logic. IJCAI 1995: 1474-1479 - 1994
- [j1]Ilkka Niemelä, Jussi Rintanen:
On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning. J. Appl. Non Class. Logics 4(2): 141-179 (1994) - [c3]Jussi Rintanen:
Prioritized Autoepistemic Logic. JELIA 1994: 232-246 - 1992
- [c2]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 - [c1]Ilkka Niemelä, Jussi Rintanen:
On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning. KR 1992: 627-638
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 21:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
