Cover Image

Pseudo-Boolean Proof Logging for Optimal Classical Planning

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dold, Simon, Helmert, Malte, Nordström, Jakob, Röger, Gabriele, Schindler, Tanja
Format:	Preprint
Published:	2025
Subjects:	Artificial Intelligence
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Formalism for Optimal Search with Dynamic Heuristics (Extended Version)
by: Christen, Remo, et al.
Published: (2025)

PBLean: Pseudo-Boolean Proof Certificates for Lean 4
by: Szeider, Stefan
Published: (2026)

Engineering an Exact Pseudo-Boolean Model Counter
by: Yang, Suwei, et al.
Published: (2023)

New Hybrid Heuristics for Pseudo-Boolean Propagation
by: Müßig, Mia, et al.
Published: (2025)

LLM-Evolved Pattern Generators for Optimal Classical Planning
by: Phung, Windy, et al.
Published: (2026)

Towards Projected and Incremental Pseudo-Boolean Model Counting
by: Yang, Suwei, et al.
Published: (2024)

Differentiable Learning of Lifted Action Schemas for Classical Planning
by: Reiter, Jonas, et al.
Published: (2026)

Practical Boolean Backpropagation
by: Golbert, Simon
Published: (2025)

Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers
by: Zheng, Jiongzhi, et al.
Published: (2024)

ParLS-PBO: A Parallel Local Search Solver for Pseudo Boolean Optimization
by: Chen, Zhihan, et al.
Published: (2024)

On the Expressive Power of GNNs for Boolean Satisfiability
by: Peltonen, Saku, et al.
Published: (2026)

Inventory of the 12 007 Low-Dimensional Pseudo-Boolean Landscapes Invariant to Rank, Translation, and Rotation
by: Liefooghe, Arnaud, et al.
Published: (2026)

DeepProofLog: Efficient Proving in Deep Stochastic Logic Programs
by: Jiao, Ying, et al.
Published: (2025)

G-CSEA: A Graph-Based Conflict Set Extraction Algorithm for Identifying Infeasibility in Pseudo-Boolean Models
by: Garg, Kanishk, et al.
Published: (2025)

Selection Hyper-heuristics Can Automatically Adjust the Learning Period to Optimally Solve Pseudo-Boolean Problems
by: Doerr, Benjamin, et al.
Published: (2026)

Efficient Lookahead Encoding and Abstracted Width for Learning General Policies in Classical Planning
by: Aichmüller, Michael, et al.
Published: (2026)

Learning More Expressive General Policies for Classical Planning Domains
by: Ståhlberg, Simon, et al.
Published: (2024)

Pseudo-Boolean d-DNNF Compilation for Expressive Feature Modeling Constructs
by: Sundermann, Chico, et al.
Published: (2025)

Boolean Observation Games
by: van Ditmarsch, Hans, et al.
Published: (2022)

Certified MaxSAT Preprocessing
by: Ihalainen, Hannes, et al.
Published: (2024)

Count-based Novelty Exploration in Classical Planning
by: Rosa, Giacomo, et al.
Published: (2024)

PDDL Axioms Are Equivalent to Least Fixed Point Logic (Extended Version)
by: Grundke, Claudia, et al.
Published: (2025)

ContraLog: Log File Anomaly Detection with Contrastive Learning and Masked Language Modeling
by: Dietz, Simon, et al.
Published: (2026)

Causal pieces: analysing and improving spiking neural networks piece by piece
by: Dold, Dominik, et al.
Published: (2025)

Equivalence of approximation by networks of single- and multi-spike neurons
by: Dold, Dominik, et al.
Published: (2026)

Scale-Adaptive Balancing of Exploration and Exploitation in Classical Planning
by: Wissow, Stephen, et al.
Published: (2023)

An Undecidability Proof for the Plan Existence Problem
by: Achilleos, Antonis
Published: (2026)

Extreme Value Monte Carlo Tree Search for Classical Planning
by: Asai, Masataro, et al.
Published: (2024)

Future-Proofing Programmers: Optimal Knowledge Tracing for AI-Assisted Personalized Education
by: Wang, Yuchen, et al.
Published: (2025)

REFACTOR: Learning to Extract Theorems from Proofs
by: Zhou, Jin Peng, et al.
Published: (2024)

Conflict-Aware Pseudo Labeling via Optimal Transport for Entity Alignment
by: Ding, Qijie, et al.
Published: (2022)

The Energy Impact of Domain Model Design in Classical Planning
by: Georgievski, Ilche, et al.
Published: (2026)

Automated Planning for Optimal Data Pipeline Instantiation
by: Amado, Leonardo Rosa, et al.
Published: (2025)

Learning Compact Boolean Networks
by: Wang, Shengpu, et al.
Published: (2026)

Learning with Boolean threshold functions
by: Elser, Veit, et al.
Published: (2026)

Intelligent Documentation in Medical Education: Can AI Replace Manual Case Logging?
by: Khan, Nafiz Imtiaz, et al.
Published: (2026)

Current Effect-eliminated Optimal Target Assignment and Motion Planning for a Multi-UUV System
by: Zhu, Danjie, et al.
Published: (2024)

From Logs to Language: Learning Optimal Verbalization for LLM-Based Recommendation at Industry Scale
by: Shi, Yucheng, et al.
Published: (2026)

BoolXLLM: LLM-Assisted Explainability for Boolean Models
by: Cheng, Du, et al.
Published: (2026)

Abstract Dialectical Frameworks are Boolean Networks (full version)
by: Heyninck, Jesse, et al.
Published: (2024)