Imagen de Portada

Pseudo-Boolean Proof Logging for Optimal Classical Planning

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Dold, Simon, Helmert, Malte, Nordström, Jakob, Röger, Gabriele, Schindler, Tanja
Formato:	Preprint
Publicado:	2025
Materias:	Artificial Intelligence
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

Practical Boolean Backpropagation
por: Golbert, Simon
Publicado: (2025)

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

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

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

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

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

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

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

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

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

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

Boolean Observation Games
por: van Ditmarsch, Hans, et al.
Publicado: (2022)

Certified MaxSAT Preprocessing
por: Ihalainen, Hannes, et al.
Publicado: (2024)

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

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

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

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

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

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

An Undecidability Proof for the Plan Existence Problem
por: Achilleos, Antonis
Publicado: (2026)

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

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

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

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

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

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

Learning Compact Boolean Networks
por: Wang, Shengpu, et al.
Publicado: (2026)

Learning with Boolean threshold functions
por: Elser, Veit, et al.
Publicado: (2026)

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

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

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

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

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