CORTEXA
← Browse
arxivcs.LOcs.AI2026-07-23

Declarative Problem Solving in UAM Strategic Deconfliction

Gioacchino Sterlicchio, Angelo Oddi, Riccardo Rasconi, Francesca Alessandra Lisi

The growing demand for Urban Air Mobility (UAM) introduces significant challenges in airspace management, particularly within densely populated metropolitan regions. As the number of aerial vehicles-such as drones, air taxis, and helicopters-continues to rise, so does the risk of mid-air collisions and conflicts with existing air traffic and obstacles. Ensuring safe and efficient UAM operations requires robust strategic deconfliction mechanisms. We propose an Answer Set Programming (ASP) based approach for strategic deconfliction, focusing on time synchronization and route optimization for conflict-free flight plans. The solution is benchmarked against Constraint Programming (CP), emphasizing scalability and resource use. Results show that ASP offers faster execution and better scalability for small to medium cases, while CP maintains stable memory but degrades with complexity.

View free PDFSource page

Related papers

arxivcs.AIcs.LOcs.PL2026-07-23

Logic Programming Semantics for Causal Processes

Felix Weitkämper

Motivated by challenging modelling issues in the life sciences, we investigate the relationship between logic programming semantics and the eventual states of causal processes compatible with those logic programs. More precisely, we show that while stable models of positive logic…

View free PDFSource page
arxivcs.LOcs.AIcs.GT2026-07-23

Animation, Verification and Visualisation of Prolog Transition Systems with ProB

Jan Gruteser, Michael Leuschel, Katharina Engels, Fabian Vu

ProB is a Prolog-based model checker, animator and constraint solver for high-level formal specifications. One can also use ProB to animate transition systems defined by Prolog predicates, allowing the application of its various validation techniques. In this work, we present the…

View free PDFSource page
arxivcs.AIcs.LO2026-07-23

Differentiable Logic Programming to Mitigate Reasoning Shortcuts in Neurosymbolic Systems

Akihiro Takemura, Katsumi Inoue

Neurosymbolic (NeSy) systems integrate neural networks with logical reasoning to achieve both generalization and interpretability, but recent work has shown they are susceptible to shortcut reasoning behaviors. We propose a novel method using matrix-based differentiable logic pro…

View free PDFSource page
arxivcs.CCcs.AIcs.DScs.LO2026-07-23

Representative Sets in Propositional Abduction

Johannes Schmidt, Mohamed Maizia, Victor Lagerkvist, Johannes K. Fichte

The propositional abduction problem is a well-known form of non-monotonic reasoning where we are asked to find an explanation of a given manifestation. Recently, there has been an influx of results asking more refined questions about the solution space rather than only individual…

View free PDFSource page