Hector Geffner

Orcid: 0000-0001-9851-8219

Affiliations:
  • RWTH Aachen University, Germany


According to our database1, Hector Geffner authored at least 143 papers between 1987 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Expressing and Exploiting Subgoal Structure in Classical Planning Using Sketches.
J. Artif. Intell. Res., 2024

General Policies, Subgoal Structure, and Planning Width.
J. Artif. Intell. Res., 2024

Combined Task and Motion Planning Via Sketch Decompositions (Extended Version with Supplementary Material).
CoRR, 2024

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

Learning to Ground Existentially Quantified Goals.
Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, 2024

Symmetries and Expressive Requirements for Learning General Policies.
Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, 2024

Learning Generalized Policies for Fully Observable Non-Deterministic Planning Domains.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Combined Task and Motion Planning via Sketch Decompositions.
Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

On Policy Reuse: An Expressive Language for Representing and Executing General Policies that Call Other Policies.
Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

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

Learning Hierarchical Policies by Iteratively Reducing the Width of Sketch Rules.
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 Sketches for Decomposing Planning Problems into Subproblems of Bounded Width: Extended Version.
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

Learning Sketches for Decomposing Planning Problems into Subproblems of Bounded Width.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

Target Languages (vs. Inductive Biases) for Learning to Act and Plan.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Expressing and Exploiting the Common Subgoal Structure of Classical Planning Domains Using Sketches: Extended Version.
CoRR, 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

Expressing and Exploiting the Common Subgoal Structure of Classical Planning Domains Using Sketches.
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

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

2018
Model-free, Model-based, and General Intelligence.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

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

Compact Policies for Fully Observable Non-Deterministic Planning as SAT.
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

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

2017
Combined Task and Motion Planning as Classical AI Planning.
CoRR, 2017

Improving Plan Quality through Heuristics for Guiding and Pruning the Search: A Study Using LAMA.
Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Purely Declarative Action Descriptions are Overrated: Classical Planning with Simulators.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

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

A Polynomial Planning Algorithm that Beats LAMA and FF.
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

Multiagent Online Planning with Nested Beliefs and Dialogue.
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

Best-First Width Search: Exploration and Exploitation in Classical Planning.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Heuristics for Planning, Plan Recognition and Parsing.
CoRR, 2016

Effective Planning with More Expressive Languages.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

∃-STRIPS: Existential Quantification in Planning and Constraint Satisfaction.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

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

Traps, Invariants, and Dead-Ends.
Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, 2016

2015
Classical Planning with Simulators: Results on the Atari Video Games.
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

Beliefs In Multiagent Planning: From One Agent to Many.
Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015

Modeling and Computation in Planning: Better Heuristics from More Expressive Languages.
Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015

Width-Based Planning for General Video-Game Playing.
Proceedings of the Eleventh AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2015

Classical Planning Algorithms on the Atari Video Games.
Proceedings of the Learning for General Competency in Video Games, 2015

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

Artificial Intelligence: From programs to solvers.
AI Commun., 2014

Non-classical Planning with a Classical Planner: The Power of Transformations.
Proceedings of the Logics in Artificial Intelligence - 14th European Conference, 2014

Width-based Algorithms for Classical Planning: New Results.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 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

Fair LTL Synthesis for Non-Deterministic Systems using Strong Cyclic Planners.
Proceedings of the IJCAI 2013, 2013

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

2012
Width and Serialization of Classical Planning Problems.
Proceedings of the ECAI 2012, 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
The model-based approach to autonomous behavior: Prospects and challenges.
Intelligenza Artificiale, 2011

Goal Recognition over POMDPs: Inferring the Intention of a POMDP Agent.
Proceedings of the IJCAI 2011, 2011

Computing Infinite Plans for LTL Goals Using a Classical Planner.
Proceedings of the IJCAI 2011, 2011

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

Searching for Plans with Carefully Designed Probes.
Proceedings of the 21st International Conference on Automated Planning and Scheduling, 2011

Heuristic Search for Generalized Stochastic Shortest Path MDPs.
Proceedings of the 21st International Conference on Automated Planning and Scheduling, 2011

Effective Heuristics and Belief Tracking for Planning with Incomplete Information.
Proceedings of the 21st International Conference on Automated Planning and Scheduling, 2011

Qualitative Numeric Planning.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Planning with Incomplete Information - (Invited Paper).
Proceedings of the Model Checking and Artificial Intelligence - 6th International Workshop, 2010

Compiling Uncertainty Away in Non-Deterministic Conformant Planning.
Proceedings of the ECAI 2010, 2010

Probabilistic Plan Recognition Using Off-the-Shelf Classical Planners.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

The Model-Based Approach to Autonomous Behavior: A Personal View.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

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

2009
Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width.
J. Artif. Intell. Res., 2009

Soft Goals Can Be Compiled Away.
J. Artif. Intell. Res., 2009

Plan Recognition as Planning.
Proceedings of the IJCAI 2009, 2009

Trees of Shortest Paths vs. Steiner Trees: Understanding and Improving Delete Relaxation Heuristics.
Proceedings of the IJCAI 2009, 2009

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

A Translation-Based Approach to Contingent Planning.
Proceedings of the IJCAI 2009, 2009

Inference and Learning in Planning (Extended Abstract).
Proceedings of the Discovery Science, 12th International Conference, 2009

Inference and Learning in Planning.
Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009

Inference and Decomposition in Planning Using Causal Consistent Chains.
Proceedings of the 19th International Conference on Automated Planning and Scheduling, 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
Heuristics for planning with penalties and rewards formulated in logic and computed through circuits.
Artif. Intell., 2008

Heuristics for Planning with Action Costs Revisited.
Proceedings of the ECAI 2008, 2008

AI at 50: From Programs to Solvers - Models and Techniques for General Intelligence.
Proceedings of the Artificial Intelligence Research and Development, 2008

Unifying the Causal Graph and Additive Heuristics.
Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, 2008

2007
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT.
Proceedings of the Principles and Practice of Constraint Programming, 2007

Heuristics for Planning with Action Costs.
Proceedings of the Current Topics in Artificial Intelligence, 2007

Fast and Informed Action Selection for Planning with Sensing.
Proceedings of the Current Topics in Artificial Intelligence, 2007

From Conformant into Classical Planning: Efficient Translations that May Be Complete Too.
Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, 2007

2006
Reports on the Twenty-First National Conference on Artificial Intelligence (AAAI-06) Workshop Program.
AI Mag., 2006

Branching and pruning: An optimal temporal POCL planner based on constraint programming.
Artif. Intell., 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

Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes).
Proceedings of the Proceedings, 2006

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

Solving Simple Planning Problems with More Inference and No Search.
Proceedings of the Principles and Practice of Constraint Programming, 2005

Search and Inference in AI Planning.
Proceedings of the Principles and Practice of Constraint Programming, 2005

Mapping Conformant Planning into SAT Through Compilation and Projection.
Proceedings of the Current Topics in Artificial Intelligence, 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

2004
Learning Generalized Policies from Planning Examples Using Concept Languages.
Appl. Intell., 2004

Planning Graphs and Knowledge Compilation.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference (KR2004), 2004

2003
PDDL 2.1: Representation vs. Computation.
J. Artif. Intell. Res., 2003

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

Branching Matters: Alternative Branching in Graphplan.
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
Perspectives on Artificial Intelligence Planning.
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 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

Planning with Uncertainty and Incomplete Information.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2001

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

Learning Generalized Policies in Planning Using Concept Languages.
Proceedings of the KR 2000, 2000

Independence in qualitative uncertainty frameworks.
Proceedings of the KR 2000, 2000

Admissible Heuristics for Optimal Planning.
Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems, 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

Modelling Intelligent Behaviour: The Markov Decision Process Approach.
Proceedings of the Progress in Artificial Intelligence, 1998

Modeling Action, Knowledge and Control.
Proceedings of the 13th European Conference on Artificial Intelligence, 1998

1997
Causality, Constraints and Indirect Effects.
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 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

A Formal Framework for Clausal Modeling and Argumentation.
Proceedings of the Practical Reasoning, 1996

A Qualitative Model for Temporal Reasoning with Incomplete Information.
Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1995
Sound and Efficient Non-monotonic Inference.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

1994
Causal Default Reasoning: Principles and Algorithms.
Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994

1992
High-probabilities, model-preference and default arguments.
Minds Mach., 1992

Conditional Entailment: Bridging two Approaches to Default Reasoning.
Artif. Intell., 1992

Default reasoning - causal and conditional theories.
MIT Press, ISBN: 978-0-262-07137-6, 1992

1991
Beyond Negation as Failure.
Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR'91). Cambridge, 1991

1990
Causal Theories for Nonmonotonic Reasoning.
Proceedings of the 8th National Conference on Artificial Intelligence. Boston, Massachusetts, USA, July 29, 1990

1989
Default Reasoning, Minimality and Coherence.
Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning (KR'89). Toronto, 1989

1988
On the Logic of Defaults.
Proceedings of the 7th National Conference on Artificial Intelligence, 1988

1987
An Improved Constraint-Propagation Algorithm for Diagnosis.
Proceedings of the 10th International Joint Conference on Artificial Intelligence. Milan, 1987


  Loading...