How to progress a database

DOI10.1016/S0004-3702(96)00044-6MaRDI QIDQ1402735zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• How to progress a database. III
• A database-type approach for progressing action theories with bounded effects
• On specifying database updates
• Action theories over generalized databases with equality constraints
• ADL and the State-Transition Model of Action

Cites work

• scientific article; zbMATH DE number 3862494 (Why is no real title available?)
• scientific article; zbMATH DE number 4162254 (Why is no real title available?)
• scientific article; zbMATH DE number 51860 (Why is no real title available?)
• scientific article; zbMATH DE number 194642 (Why is no real title available?)
• scientific article; zbMATH DE number 823599 (Why is no real title available?)
• scientific article; zbMATH DE number 3241254 (Why is no real title available?)
• Downward refinement and the efficiency of hierarchical problem solving
• GOLOG: A logic programming language for dynamic domains
• On specifying database updates
• Proving properties of states in the situation calculus
• STRIPS: A new approach to the application of theorem proving to problem solving
• State Constraints Revisited

Cited in

(35)

• When you must forget: Beyond strong persistence when forgetting in answer set programming
• First-order logical filtering
• Bounded situation calculus action theories
• Progression and verification of situation calculus agents with bounded beliefs
• A propositional encoding for first-order clausal entailment over infinitely many constants
• scientific article; zbMATH DE number 78582 (Why is no real title available?)
• A framework for belief-based programs and their verification
• On strongest necessary and weakest sufficient conditions
• What robots can do: robot programs and effective achievability
• Property persistence in the situation calculus
• A logical theory of localization
• How to progress a database. III
• Forgetting in answer set programming -- a survey
• Forgetting in multi-agent modal logics
• A semantic characterization of a useful fragment of the situation calculus with knowledge
• A description logic based situation calculus
• Forgetting in ASP: the forgotten properties
• Robot location estimation in the situation calculus
• Semantical considerations on multiagent only knowing
• Proof systems for planning under 0-approximation semantics
• scientific article; zbMATH DE number 1507285 (Why is no real title available?)
• A syntactic operator for forgetting that satisfies strong persistence
• On syntactic forgetting under uniform equivalence
• Simulating Dynamic Systems Using Linear Time Calculus Theories
• Progression of decomposed local-effect action theories
• On the limits of forgetting in answer set programming
• Towards an expressive practical logical action theory
• Belief revision and projection in the epistemic situation calculus
• A Semantical Account of Progression in the Presence of Defaults
• On the progression of belief
• ConGolog, a concurrent programming language based on the situation calculus
• Asynchronous knowledge with hidden actions in the situation calculus
• Regression and progression in stochastic domains
• Action theories over generalized databases with equality constraints
• A database-type approach for progressing action theories with bounded effects

Describes a project that uses

Uses Software

• GOLOG

This page was built for publication: How to progress a database

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1402735)