What type of study is this?

This is a Quantitative Study study.

Pseudo-Boolean Proof Logging for Optimal Classical Planning

View Full Paper

Ask AI

Bookmark

Authors

This framework generates lower-bound certificates for classical planning tasks, highlighting optimality and unsolvability.

Lower-bound certificates demonstrate task unsolvability or plan optimality through verifiable proofs, enhancing trust.
The approach uses pseudo-Boolean constraints and can adapt existing algorithms, like the A* algorithm, for proof generation.
Generating proofs of optimality incurs modest overhead while using conventional heuristics, ensuring efficiency.
This proof logging framework extends to various heuristics whose reasoning can be framed using pseudo-Boolean constraints.

Dold et al. (2025) studied this question.

View Full Paper

Ask AI

Bookmark

View Full Paper

Ask AI

Bookmark

Authors

This framework generates lower-bound certificates for classical planning tasks, highlighting optimality and unsolvability.

Lower-bound certificates demonstrate task unsolvability or plan optimality through verifiable proofs, enhancing trust.
The approach uses pseudo-Boolean constraints and can adapt existing algorithms, like the A* algorithm, for proof generation.
Generating proofs of optimality incurs modest overhead while using conventional heuristics, ensuring efficiency.
This proof logging framework extends to various heuristics whose reasoning can be framed using pseudo-Boolean constraints.

Dold et al. (2025) studied this question.

View Full Paper

Ask AI

Bookmark