← Search

Kailun Luo

4 accepted papers

2025

A Syntactic Approach to Computing Complete and Sound Abstraction in the Situation Calculus

AAAI 2025technical

Abstraction is an important and useful concept in the field of artificial intelligence. To the best of our knowledge, there is no syntactic method to compute a sound and complete abstraction from a given low-level basic action theory and a refinement mapping. This paper aims to address this issue. T…

Cited by 0SourcePDFScholar
2023

Automated Verification of Propositional Agent Abstraction for Classical Planning via CTLK Model Checking

AAAI 2023technical

Abstraction has long been an effective mechanism to help find a solution in classical planning. Agent abstraction, based on the situation calculus, is a promising explainable framework for agent planning, yet its automation is still far from being tackled. In this paper, we focus on a propositional…

2022

Automated Synthesis of Generalized Invariant Strategies via Counterexample-Guided Strategy Refinement

AAAI 2022technical

Strategy synthesis for multi-agent systems has proved to be a hard task, even when limited to two-player games with safety objectives. Generalized strategy synthesis, an extension of generalized planning which aims to produce a single solution for multiple (possibly infinitely many) planning instanc…

Cited by 1SourcePDFScholar