Proving properties of states in the situation calculus

DOI10.1016/0004-3702(93)90109-OzbMath0788.68139OpenAlexW1971925101MaRDI QIDQ1313962

Raymond Reiter

Publication date: 9 June 1994

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

Full work available at URL: https://doi.org/10.1016/0004-3702(93)90109-o

zbMATH Keywords

mathematical inductionintegrity constraintsdatabasessituation calculus

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items

Progression of Decomposed Local-Effect Action Theories, Reasoning about time in the situation calculus, A survey on temporal logics for specifying and verifying real-time systems, Planning from second principles, How to progress a database, Event calculus and temporal action logics compared, First-order logical filtering, The well-designed logical robot: learning and experience from observations to the Situation Calculus, Temporal representation and reasoning in artificial intelligence: A review, Property persistence in the situation calculus, What robots can do: robot programs and effective achievability, ConGolog, a concurrent programming language based on the situation calculus, Knowledge assimilation in domains of actions: a possible causes approach, Asynchronous knowledge with hidden actions in the situation calculus, Knowledge, action, and the frame problem, Heuristic planning: A declarative approach based on strategies for action selection

Cites Work

• On specifying database updates
• What should a database know?
• State Constraints Revisited
• Provably correct theories of action
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item