Skip to content

Towards Defeasible Reasoning about Actions and Their Effects

· 0 citations · 17 references

TL;DR

This work introduces defeasible action rules that capture the typical outcome of action, without committing to what happens in exceptional circumstances, and defines an inference operator for defeasible action rules inspired by rational closure, adapted to the dynamic setting.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

GRUET: Quantifying Uncertainty of Agentic Reasoning-and-Acting Processes

The Graph-based Reasoning UncErtainty in Trajectories (GRUET) method for the uncertainty quantification of ReAct is presented, comprising turn-level reasoning uncertainty quantification and trajectory-level uncertainty aggregation; the former precisely quantifies reasoning uncertainty via modeling the reasoning space s...

Shuang Liang, Xin-Miao Hu, Shao-Qun Zhang · 0 citations
#artificial intelligence Preprint Sep 2026

Before Agents Decide: Epistemic Action in LLM-Based Systems

Before a difficult decision, people often act simply to understand the situation better. We turn an object to see another side, place alternatives next to each other, or change one condition and observe what happens. These actions may not complete the task, but they improve the evidence needed for the next choice. LLM-...

Yi-Zhi Liu, Balaji Padmanabhan, Siva Viswanathan · 0 citations
Open access Aug 2026

Beyond Static Assumptions: The Predictive Justified Perspective Model for Epistemic Planning

The Predictive Justified Perspective (PJP) model is formally defined and proved that it retains the computational efficiency of state-based planning while ensuring logically sound belief reasoning (satisfying the KD45 axioms).

Guang Hu, Weijia Li, Yangmengfei Xu · 0 citations
Sep 2026

Reasoning about the past in epistemic logic with separation

It is shown that, if the horizon of epistemic actions is bounded, the multiplicative connectives can be eliminated from a logical language with also epistemic and action model modalities.

H. van Ditmarsch, D. Galmiche · 0 citations

Proper Open World Automated Planning

It is shown a proof-of-the-concept lifted planner can sometimes solve the BPP problem by using a domain-independent heuristic that guides search for a plan.

Mikhail Soutchanski · 0 citations
#artificial intelligence Preprint Sep 2026

ArgGYM: A Procedural, Engine-Verified Benchmark for Structured Defeasible Reasoning

Recent progress in large language model reasoning has been driven by benchmarks and reinforcement learning environments with automatically verifiable rewards, particularly in mathematics, code, and formal logic. These settings make model accuracy easier to evaluate and optimize, but it remains unclear how far success u...

Ibrahim Ethem Deveci, Funda Tan Çalık, Barış Deniz Sağlam et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.