Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Belnap-Dunn Logic and Query Answering in Inconsistent Databases with Null Values
View through CrossRef
This paper concerns an expansion of first-order Belnap-Dunn logic, called BD^{\supset,F}_{\bot}, and an application of this logic in the area of relational database theory. The notion of a relational database, the notion of a query applicable to a relational database, and several notions of an answer to a query with respect to a relational database are considered from the perspective of this logic, taking into account that a database may be an inconsistent database and/or a database with null values. The chosen perspective enables among other things the definition of a notion of a consistent answer to a query with respect to a possibly inconsistent database without resort to database repairs. For each of the notions of an answer considered, being an answer to a query with respect to a database of the kind considered is decidable.
Editura Universitatii Alexandru Ioan Cuza din Iasi
Title: Belnap-Dunn Logic and Query Answering in Inconsistent Databases with Null Values
Description:
This paper concerns an expansion of first-order Belnap-Dunn logic, called BD^{\supset,F}_{\bot}, and an application of this logic in the area of relational database theory.
The notion of a relational database, the notion of a query applicable to a relational database, and several notions of an answer to a query with respect to a relational database are considered from the perspective of this logic, taking into account that a database may be an inconsistent database and/or a database with null values.
The chosen perspective enables among other things the definition of a notion of a consistent answer to a query with respect to a possibly inconsistent database without resort to database repairs.
For each of the notions of an answer considered, being an answer to a query with respect to a database of the kind considered is decidable.
Related Results
Query expansion by relying on the structure of knowledge bases
Query expansion by relying on the structure of knowledge bases
Query expansion techniques aim at improving the results achieved by a user's query by means of introducing new expansion terms, called expansion features. Expansion features introd...
Logics of Involutive Stone Algebras
Logics of Involutive Stone Algebras
Abstract
An involutive Stone algebra (IS-algebra) is a structure that is simultaneously a De Morgan algebra and a Stone algebra (i.e. a pseudo-complemented distributive lat...
MECHANISMS OF SCHEMATIC MODELING BASED ON VECTOR LOGIC
MECHANISMS OF SCHEMATIC MODELING BASED ON VECTOR LOGIC
Context. This paper addresses issues relevant to the EDA market – reducing the cost and time of testing and verification of digital projects by synthesizing the logic vector of a d...
The
B
4
-valued propositional Belnap-Dunn logic
The
B
4
-valued propositional Belnap-Dunn logic
Abstract
A
B
4
-valued propositiona...
A Survey of Query Auto Completion in Information Retrieval
A Survey of Query Auto Completion in Information Retrieval
In information retrieval, query auto completion (QAC), also known as type-ahead [Xiao et al., 2013, Cai et al., 2014b] and auto-complete suggestion [Jain and Mishne, 2010], refers ...
Logic in the early 20th century
Logic in the early 20th century
The creation of modern logic is one of the most stunning achievements of mathematics and philosophy in the twentieth century. Modern logic – sometimes called logistic, symbolic log...
Power Matrices and Dunn-Belnap Semantics: Reflections on a Remark of Graham Priest
Power Matrices and Dunn-Belnap Semantics: Reflections on a Remark of Graham Priest
The plurivalent logics considered in Graham Priest's recent paper of that name can be thought of as logics determined by matrices (in the 'logical matrix' sense) whose underlying a...
RaPID-Query for Fast Identity by Descent Search and Genealogical Analysis
RaPID-Query for Fast Identity by Descent Search and Genealogical Analysis
Abstract
The size of genetic databases has grown large enough such that, genetic genealogical search, a process of inferring familial relatedness by identifying DNA...