How to Progress a Database
By Fangzhen Lin, Raymond Reiter. 1997
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Vaishak Belle
- Gerhard Lakemeyer
- Hector J. Levesque
- Giuseppe De Giacomo
- Yves Lespérance
- Samuel R. Bowman
- Diego Calvanese
- Sheila A. McIlraith
Citations in the corpus
- Logic meets Probability: Towards Explainable AI Systems for Uncertain Worlds (2017, background): “Indeed, the situation calculus has proven helpful in providing formal under-pinnings to automated planning formalisms [Lin and Reiter, 1997; McIlraith and Son, 2002], updates in closed-and open-world databases [ Hariri et al. , 2013 ] , and dynamic Bayesian networks over complex actions [Hajishirzi…”
- How to Progress Beliefs in Continuous Domains (2014, background): “Proof sketch: The proof is based on ideas in (Lin and Reiter 1997).”
- ConGolog, a concurrent programming language based on the situation calculus (2000, background): “If the program is willing to commit to a particular sequence of actions, it is possible progress the initial situation theory to a new initial situation theory representing the state of a airs after the sequence of actions [19].”
- Reasoning about Probabilities in Unbounded First-Order Dynamical Domains (2017, background): “4To handle only knowing after actions, an account of progression is needed [Lin and Reiter, 1997; Lakemeyer and Levesque, 2009], a topic we leave for the future.”
- A Logical Theory of Localization (2015, background): “Projection is fundamental in planning and high-level programming [46], and is a major concern in reasoning about action [38].”
- Multiagent Only Knowing in Dynamic Systems (2014, background): “For long-lived agents, regression would become infeasible after millions of actions, and so we would need to periodically update the knowledge base, which is referred to as progression (Lin & Reiter, 1997).”
- Semantical considerations on multiagent only knowing (2015, background): “Fortunately, there are well-known methodologies for resolving actions, either by reducing queries about the future to queries about the initial state or by updating the knowledge base [7,41,46,49].”
- On the Progression of Knowledge in Multiagent Systems (2014, unknown): “As argued in (Reiter 2001), there is only one computational methodology that addresses this problem at large: the idea of progressing the current world state, investigated in a general way for the language of the situation calculus in (Lin and Reiter 1997).”
- On Progression and Query Evaluation in First-Order Knowledge Bases with Function Symbols (2011, background): “In a seminal paper, Lin and Reiter (LR) [1997] developed the theory of progression , where the idea is to update the initial KB.”