Sophisticated Approaches and Formal Verification in AI and Planning

The recent developments in the research area indicate a significant shift towards more sophisticated and integrated approaches in various subfields. There is a notable emphasis on leveraging formal methods and advanced computational techniques to address complex problems in automated decision-making, temporal reasoning, and probabilistic programming. The field is witnessing a surge in the use of compositional and algebraic frameworks for inference queries, which promise to unify and simplify tractability conditions across different problems. Additionally, there is a growing interest in high-level modeling and enhanced expressivity in automated planning, with efforts to extend existing languages and libraries to better handle complex scenarios. The integration of AI planning with other AI sub-disciplines, such as reinforcement learning and operations research, is also being actively explored to bridge existing gaps and foster cross-disciplinary insights. Furthermore, the application of POMDPs in trajectory planning for autonomous vehicles highlights the versatility and practical relevance of these models in real-world scenarios. The trend towards formal verification and mechanization of reasoning algorithms is gaining traction, ensuring correctness and reliability in high-stakes applications. Overall, the field is progressing towards more robust, efficient, and theoretically grounded solutions, with a strong focus on practical applicability and interdisciplinary collaboration.

Noteworthy papers include one that introduces a compositional atlas for algebraic circuits, providing novel tractability conditions for compositional queries, and another that presents a verified implementation of continuous double auctions, significantly improving efficiency and providing a tool for market regulators.

Sources

Tuning Trains Speed in Railway Scheduling

CMSO-transducing tree-like graph decompositions

A Compositional Atlas for Algebraic Circuits

AI Planning: A Primer and Survey (Preliminary Report)

Small Term Reachability and Related Problems for Terminating Term Rewriting Systems

Towards High-Level Modelling in Automated Planning

Parameter Adjustments in POMDP-Based Trajectory Planning for Unsignalized Intersections

Normal Nested Answer Set Programs: Syntactics, Semantics and Logical Calculi

A Program Instrumentation Framework for Automatic Verification

A Fixed Point Iteration Technique for Proving Correctness of Slicing for Probabilistic Programs

Goal-Driven Reasoning in DatalogMTL with Magic Sets

An Abstract Account of Up-to Techniques for Inductive Behavioural Relations

POMDP-Based Trajectory Planning for On-Ramp Highway Merging

Provenance Analysis and Semiring Semantics for First-Order Logic

Intrinsically Correct Sorting in Cubical Agda

A Principled Solution to the Disjunction Problem of Diagrammatic Query Representations

Efficient and Verified Continuous Double Auctions

VEL: A Formally Verified Reasoner for OWL2 EL Profile

Temporal Numeric Planning with Patterns

Goal-Driven Query Answering over First- and Second-Order Dependencies with Equality

Built with on top of