What robots can do: robot programs and effective achievability

DOI10.1016/S0004-3702(98)00041-1zbMath0909.68176OpenAlexW2085177759MaRDI QIDQ1274278

Hector J. Levesque, Fangzhen Lin

Publication date: 12 January 1999

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(98)00041-1

zbMATH Keywords

roboticscognitive roboticsabilitiessituation calculusachievabilityeffective achievabilityrobot programstheories of actions

Mathematics Subject Classification ID

Automated systems (robots, etc.) in control theory (93C85) Computing methodologies and applications (68U99) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items (4)

Analyzing generalized planning under nondeterminism ⋮ Property persistence in the situation calculus ⋮ A correctness result for synthesizing plans with loops in stochastic domains ⋮ Asynchronous knowledge with hidden actions in the situation calculus

Uses Software

• GOLOG
• UCPOP

Cites Work

• How to clear a block: a theory of plans
• Proving properties of states in the situation calculus
• An ordering on subgoals for planning
• How to progress a database
• Ability and knowing how in the situation calculus
• STRIPS: A new approach to the application of theorem proving to problem solving
• State Constraints Revisited
• Knowledge Preconditions for Plans
• GOLOG: A logic programming language for dynamic domains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: What robots can do: robot programs and effective achievability