arXiv:2601. 20735v2 Announce Type: replace Abstract: We develop a computational approach to Metric Answer Set Programming (ASP) to allow for expressing quantitative temporal constraints, like durations and deadlines.
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.
arXiv:2609.22213v1 Announce Type: new Abstract: Temporal Knowledge Graph Question Answering (TKGQA) requires answer inference from evidence that is both structurally valid and temporally admissible....
arXiv:2609.01032v1 Announce Type: cross Abstract: Automated mining of formal specifications is vital for verifying real-time systems. However, existing passive learning approaches remain restricted t...
arXiv:2601.07148v4 Announce Type: replace-cross Abstract: Tool use, such as web search, has become a standard capability even in freely available large language models (LLMs). However, existing bench...
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.
arXiv:2508.01751v3 Announce Type: replace Abstract: Modeling scheduling problems with conditional time intervals and cumulative functions has become a common approach when using modern commercial con...
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.
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.
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.
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.
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, ...
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.