How to progress a database

DOI10.1016/S0004-3702(96)00044-6zbMath1017.68510OpenAlexW1973391999MaRDI QIDQ1402735

Fangzhen Lin, Ray Reiter

Publication date: 28 August 2003

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

Full work available at URL: https://doi.org/10.1016/s0004-3702(96)00044-6

zbMATH Keywords

RegressionSituation calculusSTRIPSProgressionStrongest postconditionsTheories of actions

Mathematics Subject Classification ID

Database theory (68P15) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Related Items

Progression of Decomposed Local-Effect Action Theories ⋮ Bounded situation calculus action theories ⋮ Progression and verification of situation calculus agents with bounded beliefs ⋮ A logical theory of localization ⋮ Simulating Dynamic Systems Using Linear Time Calculus Theories ⋮ Action Theories over Generalized Databases with Equality Constraints ⋮ A description logic based situation calculus ⋮ Belief revision and projection in the epistemic situation calculus ⋮ Semantical considerations on multiagent only knowing ⋮ When you must forget: Beyond strong persistence when forgetting in answer set programming ⋮ Proof systems for planning under 0-approximation semantics ⋮ A Syntactic Operator for Forgetting that Satisfies Strong Persistence ⋮ On the progression of belief ⋮ Robot location estimation in the situation calculus ⋮ On the limits of forgetting in answer set programming ⋮ A semantic characterization of a useful fragment of the situation calculus with knowledge ⋮ First-order logical filtering ⋮ On strongest necessary and weakest sufficient conditions ⋮ Property persistence in the situation calculus ⋮ Regression and progression in stochastic domains ⋮ On syntactic forgetting under uniform equivalence ⋮ A Semantical Account of Progression in the Presence of Defaults ⋮ What robots can do: robot programs and effective achievability ⋮ Forgetting in ASP: The Forgotten Properties ⋮ Forgetting in multi-agent modal logics ⋮ ConGolog, a concurrent programming language based on the situation calculus ⋮ Asynchronous knowledge with hidden actions in the situation calculus

Uses Software

• GOLOG

Cites Work

• Proving properties of states in the situation calculus
• Downward refinement and the efficiency of hierarchical problem solving
• STRIPS: A new approach to the application of theorem proving to problem solving
• On specifying database updates
• State Constraints Revisited
• GOLOG: A logic programming language for dynamic domains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item