arXiv:2605. 29965v2 Announce Type: replace Abstract: The development of temporal extensions of Answer Set Programming (ASP) has led to the emergence of non-monotonic linear-time (TEL), dynamic (DEL), and metric (MEL) temporal equilibrium logics.
By Susana Hahn, Amad\'e Nemes, Javier Romero, Torsten Schaub
arXiv:2607. 13344v1 Announce Type: new Abstract: Constraint Answer Set Programming (CASP) is a hybrid reasoning paradigm that combines Answer Set Programming (ASP) with Constraint Processing and Satisfiability Modulo Theories (SMT), enabling powerful declarative encodings of complex combinatorial search problems.
By Yuliya Lierler
arXiv:2607. 21197v1 Announce Type: cross Abstract: The growing demand for Urban Air Mobility (UAM) introduces significant challenges in airspace management, particularly within densely populated metropolitan regions.
By Gioacchino Sterlicchio (DMMM, Polytechnic University of Bari, Bari, Italy), Angelo Oddi (ISTC-CNR, Rome, Italy), Riccardo Rasconi (ISTC-CNR, Rome, Italy), Francesca Alessandra Lisi (DIB,CILA, University of Bari Aldo Moro, Bari, Italy)
arXiv:2607. 21201v1 Announce Type: new Abstract: While the integration of linear constraints has significantly expanded the reach of Answer Set Programming (ASP), existing hybrid solvers often rely on disparate semantic underpinnings that lack a unified logical foundation.
By Pedro Cabalar (University of A Corunna, Spain), Jorge Fandinno (University of Nebraska at Omaha, USA), Nicolas R\"uhling (University of Potsdam, Germany), Torsten Schaub (University of Potsdam, Germany,Potassco Solutions, Germany), Sebastian Schellhorn (University of Potsdam, Germany), Philipp Wanko (University of Potsdam, Germany,Potassco Solutions, Germany)
arXiv:2604. 19251v2 Announce Type: replace-cross Abstract: Streamliner constraints reduce the search space of combinatorial problems by ruling out portions of the solution space.
By Florentina Voboril (TU Wien), Martin Gebser (University of Klagenfurt), Stefan Szeider (TU Wien), Alice Tarzariol (University of Klagenfurt)
arXiv:2607. 11327v1 Announce Type: cross Abstract: Model editing keeps large language models (LLMs) up to date without retraining, but temporal facts expose a limitation of the prevailing locate-and-edit paradigm: an update is not always a replacement.
By Chen Huang (Tsinghua University), Qi Zheng (Tsinghua University), Ruiqin Zheng (ByteDance), Long Zeng (Tsinghua University), Yuantong Xu (ByteDance)
arXiv:2606. 01591v1 Announce Type: cross Abstract: The TimeLogic Challenge evaluates formal temporal-logic reasoning over video - 16 operators (before, after, until, since, always, co-occur, ordering, ...
By Ali Alavi
The deployment of Vision-Language Models (VLMs) in autonomous driving (AD) systems is constrained by on-board computing power, restricting vehicles to small VLMs (SVLMs) with limited perception and reasoning capabilities. Infrastructure-assisted AD alleviates this resource constraint by enabling collaboration with large VLMs (LVLMs) at edge servers.
Operational Air Traffic Flow and Capacity Management (ATFCM) balances flight demand with available sector capacity, to ensure safe and efficient operations. Mathematical models enhance operational ATFCM performance by framing demand-capacity balancing as an optimization problem, maximizing efficiency while adhering to safety constraints.
arXiv:2607. 03550v1 Announce Type: new Abstract: Human reasoning often operates through qualitative concepts expressed by linguistic labels such as high, low, expensive, or cheap, whose interpretation depends on context and is usually vague, despite being rooted in numerical data.
By Luca Ferragina, Ilenia Galati, Lorena Gullone, Francesco Scarcello
arXiv:2601. 09097v3 Announce Type: replace Abstract: Multi-constraint planning involves identifying, evaluating, and refining candidate plans while satisfying multiple, potentially conflicting constraints.
By Derrick Goh Xin Deik, Quanyu Long, Zhengyuan Liu, Nancy F. Chen, Wenya Wang
arXiv:2607. 04784v1 Announce Type: cross Abstract: Defining the reasoning boundaries and ensuring the reliability of Large Reasoning Models (LRMs) remains a critical challenge.
By Shide Zhou, Kailong Wang, Ling Shi, Haoyu Wang