Blai Bonet

According to our database1, Blai Bonet authored at least 88 papers between 1996 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On Policy Reuse: An Expressive Language for Representing and Executing General Policies that Call Other Policies.
CoRR, 2024

Learning General Policies for Classical Planning Domains: Getting Beyond C<sub>2</sub>.
CoRR, 2024

2023
General Policies, Subgoal Structure, and Planning Width.
CoRR, 2023

Learning General Policies with Policy Gradient Methods.
Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 2023

2022
Flexible FOND Planning with Explicit Fairness Assumptions.
J. Artif. Intell. Res., 2022

Language-Based Causal Representation Learning.
CoRR, 2022

Learning First-Order Symbolic Planning Representations That Are Grounded.
CoRR, 2022

Learning Generalized Policies without Supervision Using GNNs.
Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, 2022

Learning General Optimal Policies with Graph Neural Networks: Expressive Power, Transparency, and Limits.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

2021
Learning General Policies from Small Examples Without Supervision.
CoRR, 2021

Learning First-Order Representations for Planning from Black Box States: New Results.
Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

Learning General Planning Policies from Small Examples Without Supervision.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

General Policies, Representations, and Planning Width.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Qualitative Numeric Planning: Reductions and Complexity.
J. Artif. Intell. Res., 2020

General Policies, Serializations, and Planning Width.
CoRR, 2020

High-level Programming via Generalized Planning and LTL Synthesis.
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

Learning First-Order Symbolic Representations for Planning from the Structure of the State Space.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

2019
Action Selection for MDPs: Anytime AO* vs. UCT.
CoRR, 2019

Learning First-Order Symbolic Planning Representations from Plain Graphs.
CoRR, 2019

Guarantees for Sound Abstractions for Generalized Planning (Extended Paper).
CoRR, 2019

Guarantees for Sound Abstractions for Generalized Planning.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Learning Features and Abstract Actions for Computing Generalized Plans.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Features, Projections, and Representation Change for Generalized Planning.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Planning With Pixels in (Almost) Real Time.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Generalized Planning: Non-Deterministic Abstractions and Trajectory Constraints.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Abstraction Heuristics, Cost Partitioning and Network Flows.
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

Completeness of Online Planners for Partially Observable Deterministic Tasks.
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

Higher-Dimensional Potential Heuristics for Optimal Classical Planning.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Factored Probabilistic Belief Tracking.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015
A Summary of the Twenty-Ninth AAAI Conference on Artificial Intelligence.
AI Mag., 2015

Heuristics for Cost-Optimal Classical Planning Based on Linear Programming.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Policies that Generalize: Solving Many Planning Problems with the Same Policy.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014
Recent advances in unfolding technique.
Theor. Comput. Sci., 2014

Belief Tracking for Planning with Sensing: Width, Complexity and Approximations.
J. Artif. Intell. Res., 2014

Universal First-Order Logic is Superfluous for NL, P, NP and coNP.
Log. Methods Comput. Sci., 2014

LP-Based Heuristics for Cost-Optimal Planning.
Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

Flow-Based Heuristics for Optimal Planning: Landmarks and Merges.
Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

Flexible and Scalable Partially Observable Planning with Linear Translations.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
A Concise Introduction to Models and Methods for Automated Planning
Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool Publishers, ISBN: 978-3-031-01564-9, 2013

Causal Belief Decomposition for Planning with Sensing: Completeness Results and Practical Approximation.
Proceedings of the IJCAI 2013, 2013

An Admissible Heuristic for SAS+ Planning Obtained from the State Equation.
Proceedings of the IJCAI 2013, 2013

Automatic Reductions from PH into STRIPS or How to Generate Short Problems with Very Long Solutions.
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

2012
Syntactic characterizations of completeness using duals and operators.
Log. J. IGPL, 2012

Width and Complexity of Belief Tracking in Non-Deterministic Conformant and Contingent Planning.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

Action Selection for MDPs: Anytime AO* Versus UCT.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Planning under Partial Observability by Classical Replanning: Theory and Experiments.
Proceedings of the IJCAI 2011, 2011

Automatic Polytime Reductions of NP Problems into a Fragment of STRIPS.
Proceedings of the 21st International Conference on Automated Planning and Scheduling, 2011

A Complete Algorithm for Generating Landmarks.
Proceedings of the 21st International Conference on Automated Planning and Scheduling, 2011

Abstraction Heuristics Extended with Counting Abstractions.
Proceedings of the 21st International Conference on Automated Planning and Scheduling, 2011

2010
Conformant plans and beyond: Principles and complexity.
Artif. Intell., 2010

STEREO: a SaT-based tool for an optimal solution of the sERvice selEctiOn problem.
Proceedings of the ISWC 2010 Posters & Demonstrations Track: Collected Abstracts, 2010

An Expressive and Efficient Solution to the Service Selection Problem.
Proceedings of the Semantic Web - ISWC 2010 - 9th International Semantic Web Conference, 2010

Strengthening Landmark Heuristics via Hitting Sets.
Proceedings of the ECAI 2010, 2010

Automatic Derivation of Finite-State Machines for Behavior Control.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Finite-State Controllers Based on Mealy Machines for Centralized and Decentralized POMDPs.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Deterministic POMDPs Revisited.
Proceedings of the UAI 2009, 2009

Solving POMDPs: RTDP-Bel vs. Point-based Algorithms.
Proceedings of the IJCAI 2009, 2009

Automatic Derivation of Memoryless Policies and Finite-State Controllers Using Classical Planners.
Proceedings of the 19th International Conference on Automated Planning and Scheduling, 2009

2008
Directed Unfolding of Petri Nets.
Trans. Petri Nets Other Model. Concurr., 2008

Heuristics for planning with penalties and rewards formulated in logic and computed through circuits.
Artif. Intell., 2008

2007
On the Speed of Convergence of Value Iteration on Stochastic Shortest-Path Problems.
Math. Oper. Res., 2007

On Canonical Forms of Complete Problems via First-order Projections
CoRR, 2007

External Memory Value Iteration.
Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, 2007

Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Heuristics for Planning with Penalties and Rewards using Compiled Knowledge.
Proceedings of the Proceedings, 2006

Learning Depth-First Search: A Unified Approach to Heuristic Search in Deterministic and Non-Deterministic Settings, and Its Application to MDPs.
Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 2006

Bounded Branching and Modalities in Non-Deterministic Planning.
Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 2006

Compilation of Query-Rewriting Problems into Tractable Fragments of Propositional Logic.
Proceedings of the Proceedings, 2006

2005
mGPT: A Probabilistic Planner Based on Heuristic Search.
J. Artif. Intell. Res., 2005

Pruning Conformant Plans by Counting Models on Compiled d-DNNF Representations.
Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS 2005), 2005

New Admissible Heuristics for Domain-Independent Planning.
Proceedings of the Proceedings, 2005

An Algorithm Better than AO*?
Proceedings of the Proceedings, 2005

2003
Faster Heuristic Search Algorithms for Planning with Uncertainty and Full Feedback.
Proceedings of the IJCAI-03, 2003

GPT Meets PSR.
Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling (ICAPS 2003), 2003

Labeled RTDP: Improving the Convergence of Real-Time Dynamic Programming.
Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling (ICAPS 2003), 2003

2002
Qualitative MDPs and POMDPs: An Order-Of-Magnitude Approximation.
Proceedings of the UAI '02, 2002

An epsilon-Optimal Grid-Based Algorithm for Partially Observable Markov Decision Processes.
Proceedings of the Machine Learning, 2002

2001
Planning and Control in Artificial Intelligence: A Unifying Perspective.
Appl. Intell., 2001

Heuristic Search Planner 2.0.
AI Mag., 2001

Planning as heuristic search.
Artif. Intell., 2001

Instrumentality Tests Revisited.
Proceedings of the UAI '01: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, 2001

A Calculus for Causal Relevance.
Proceedings of the UAI '01: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, 2001

2000
The AIPS-98 Planning Competition.
AI Mag., 2000

Planning with Incomplete Information as Heuristic Search in Belief Space.
Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems, 2000

1999
Planning as Heuristic Search: New Results.
Proceedings of the Recent Advances in AI Planning, 5th European Conference on Planning, 1999

1998
Learning Sorting and Decision Trees with POMDPs.
Proceedings of the Fifteenth International Conference on Machine Learning (ICML 1998), 1998

1997
A Robust and Fast Action Selection Mechanism for Planning.
Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997

1996
Arguing for Decisions: A Qualitative Model of Decision Making.
Proceedings of the UAI '96: Proceedings of the Twelfth Annual Conference on Uncertainty in Artificial Intelligence, 1996


  Loading...