منابع مشابه
A Logic for Revision and Subjunctive Queries
We present a logic for belief revision in which revision of a theory by a sentence is represented using a conditional connective. The conditional is not primitive, but rather defined using two unary modal operators. Our approach captures and extends the classic AGM model without relying on the Limit Assumption. Reasoning about counterfactual or hypothetical situations is also crucial for AI. Ex...
متن کاملQueries Independent of Updates
This paper considers the problem of detecting independence of a queries expressed by datalog programs from updates. We provide new insight into the independence problem by reducing it to the equivalence problem for datalog programs (both for the case of insertion and deletion updates). Equivalence, as well as independence, is undecidable in general. However, algorithms for detecting subclasses ...
متن کاملRecording Provenance for SQL Queries and Updates
Knowing the origin of data (i.e., where the data was copied or created from)—its provenance—is vital for assessing the trustworthiness of contemporary scientific databases such as UniProt [16] and SWISSPROT [14]. Unfortunately, provenance information must currently be recorded manually, by added effort of the database maintainer. Since such maintenance is tedious and error-prone, it is desirabl...
متن کاملSubjunctive credences and semantic humility
In light of the chance that the plate will be saved by a sudden gust of hot air, what should we say about the truth conditions of the ordinary conditional (1b)? Some theories predict that (1b) is true. For instance, Lewis 1973b says that the plate being saved by friendly air currents is a remarkable low-probability event, and that worlds where such events happen are farther away than worlds whe...
متن کاملLogarithmic-Time Updates and Queries in Probabilistic Networks
Traditional databases commonly support e cient query and update procedures that operate in time which is sublinear in the size of the database. Our goal in this paper is to take a rst step toward dynamic reasoning in probabilistic databases with comparable e ciency. We propose a dynamic data structure that supports e cient algorithms for updating and querying singly connected Bayesian networks....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1995
ISSN: 0890-5401
DOI: 10.1006/inco.1995.1017