Capstractcscapstract:2611.00006

Computer Science > Artificial Intelligence

Title:Planning for the Termination of Reciprocal Obligations

Abstract:

A delivery action may satisfy an outstanding obligation and create a second obligation in the opposite direction. Planners that project a task onto possession alone can therefore report success in a state with an executable return action. We study this discrepancy in the return of borrowed serving dishes. We give an obligation ledger with separately observable custody and release, and characterize a class of return rules under which every compliant sequence preserves a positive outstanding balance. We then model authorization for empty return as an observation-dependent action and solve for a finite-horizon policy over the resulting belief states. In 800 held-out initial states, a ledger-aware policy completes 692 (86.5%), compared with 620 (77.5%) for maximum-posterior replanning, a paired difference of 9.0 percentage points (95% family-bootstrap interval 5.5 to 12.6). Under compulsory refill, closure is impossible even when scheduled exchanges always succeed. A benchmark extension in which one serving dish arrives inside another exposes cases where obtaining permission to return the inner dish supplies the occasion required to renew the outer obligation.

Comments:3 figures, 3 tables. Includes formal results and an evaluation appendix.
Subjects:Artificial Intelligence (cs.AI)
Cite as:capstract:2611.00006 [cs.AI]
 (or capstract:2611.00006v1 [cs.AI] for this version)

Submission history

From: Elvira S. Montalbán
[v1] Mon, 2 Nov 2026 17:53:39 UTC (181 KB)

Current browse context:

cs
Change to browse by:

Export citation