Planning under uncertainty as G<scp>OLOG</scp>programs

DOI10.1080/0952813031000064567zbMath1105.68334OpenAlexW2089872474MaRDI QIDQ4467045

Javier Pinto, Jorge A. Baier

Publication date: 8 June 2004

Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0952813031000064567

zbMATH Keywords

uncertaintyplanningcognitive roboticsloop induction

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Artificial intelligence for robotics (68T40)

Uses Software

• pGOLOG
• ConGolog
• GOLOG
• Graphplan

Cites Work

• A logic-based calculus of events
• The computational complexity of propositional STRIPS planning
• Fast planning through planning graph analysis
• ConGolog, a concurrent programming language based on the situation calculus
• Using temporal logics to express search control knowledge for planning
• STRIPS: A new approach to the application of theorem proving to problem solving
• Some contributions to the metatheory of the situation calculus
• NON-DETERMINISM AND UNCERTAINTY IN THE SITUATION CALCULUS
• GOLOG: A logic programming language for dynamic domains
• Integrating planning and learning: the PRODIGY architecture
• LAO*: A heuristic search algorithm that finds solutions with loops
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Planning under uncertainty as G<scp>OLOG</scp>programs