Hypothetical datalog: complexity and expressibility
Lecture notes in computer science on ICDT '88
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Recursively indefinite databases (extended abstract)
ICDT '90 Proceedings of the third international conference on database theory on Database theory
Elements of relational database theory
Handbook of theoretical computer science (vol. B)
Propositional knowledge base revision and minimal change
Artificial Intelligence
The human genome project and informatics
Communications of the ACM
On the complexity of propositional knowledge base revision, updates, and counterfactuals
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Non-deterministic languages to express deterministic transformations
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Explicit control of logic programs through rule algebra
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Update semantics of relational views
ACM Transactions on Database Systems (TODS)
On the semantics of updates in databases
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
On the semantics of theory change: arbitration between old and new information
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The complexity of model checking for belief revision and update
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Socio-cognitive mechanisms of belief change
Cognitive Systems Research
Credibility of Information for Modelling Belief State and Its Change
Fundamenta Informaticae
Modifying Intensional Logic Knowledge
Fundamenta Informaticae
| Hi-index | 0.00 |
We propose a language that expresses uniformly queries and updates on knowledgebases consisting of finite sets of relational structures. The language contains an operator that “inserts” arbitrary first-order sentences into knowledgebase. The semantics of the insertion is based on the notion of update formalized by Katsuno and Mendelzon in the context of belief revision theory. Our language can express, among other things, hypothetical queries and queries on recursively indefinite databases. The expressive power of our language lies between existential second-order and general second-order queries. The data complexity is in general within exponential time, although it can be lowered to co-NP and to polynomial time by restricting the form of queries and updates.