arXiv:2002. 11508v3 Announce Type: replace Abstract: TCSPs (Temporal Constraint Satisfaction Problems) [Dechter et al.
Summary generated by The Flow from the publisher's feed. The full article lives at arXiv AI.
The Simple Temporal Problem (STP) is a core framework for quantitative temporal constraints. As STP data can be inconsistent, we study MAXSTP: compute a maximum-cardinality consistent subset of constraints.
arXiv:2607. 23785v1 Announce Type: cross Abstract: The Simple Temporal Problem (STP) is a core framework for quantitative temporal constraints.
arXiv:2606. 06240v1 Announce Type: cross Abstract: Persistent memory for an LLM agent is a write-heavy substrate: every belief update is a versioned write, and a new claim may contradict a stored one.
arXiv:2607. 18357v1 Announce Type: cross Abstract: Large language models now write a growing share of the world's code, increasingly inside agents and serving systems that compile, execute, or dispatch generated code without line-by-line review.
arXiv:2608. 11318v1 Announce Type: cross Abstract: Many sequential construction tasks exhibit exact symmetry at completion while their execution remains directed and history-dependent.
arXiv:2608. 04552v1 Announce Type: cross Abstract: Black-box language-model reliability is commonly pursued by sampling, prompting, voting, verifying, or iteratively revising individual answers.