Research map / Learning theory and algorithms / Combinatorial and search optimization
Verifying ConGolog Programs on Bounded Situation Calculus Theories
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Decidable Verification of Golog Programs over Non-Local Effect Actions (AAAI 2016 · similarity 0.90)
- A Syntactic Approach to Computing Complete and Sound Abstraction in the Situation Calculus (AAAI 2025 · similarity 0.88)
- On Action Theories with Iterable First-Order Progression (AAAI 2025 · similarity 0.86)
- Situation Calculus Temporally Lifted Abstractions for Generalized Planning (AAAI 2025 · similarity 0.85)
- Lemur: Integrating Large Language Models in Automated Program Verification (ICLR 2024 · similarity 0.85)
- First-Order Automata (AAAI 2025 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.