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.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.
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...