15 research outputs found
Data Credence in IoT: Vision and Challenges
As the Internet of Things permeates every aspect of human life, assessing the credence or integrity of the data generated by "things" becomes a central exercise for making decisions or in auditing events. In this paper, we present a vision of this exercise that includes the notion of data credence, assessing data credence in an efficient manner, and the use of technologies that are on the horizon for the very large scale Internet of Things
Data Credence in IoR: Vision and Challenges
As the Internet of Things permeates every aspect of human life, assessing the credence or integrity of the data generated by "things" becomes a central exercise for making decisions or in auditing events. In this paper, we present a vision of this exercise that includes the notion of data credence, assessing data credence in an efficient manner, and the use of technologies that are on the horizon for the very large scale Internet of Things
Coherent Integration of Databases by Abductive Logic Programming
We introduce an abductive method for a coherent integration of independent
data-sources. The idea is to compute a list of data-facts that should be
inserted to the amalgamated database or retracted from it in order to restore
its consistency. This method is implemented by an abductive solver, called
Asystem, that applies SLDNFA-resolution on a meta-theory that relates
different, possibly contradicting, input databases. We also give a pure
model-theoretic analysis of the possible ways to `recover' consistent data from
an inconsistent database in terms of those models of the database that exhibit
as minimal inconsistent information as reasonably possible. This allows us to
characterize the `recovered databases' in terms of the `preferred' (i.e., most
consistent) models of the theory. The outcome is an abductive-based application
that is sound and complete with respect to a corresponding model-based,
preferential semantics, and -- to the best of our knowledge -- is more
expressive (thus more general) than any other implementation of coherent
integration of databases
Paraconsistent logic and query answering in inconsistent databases
This paper concerns the paraconsistent logic LPQ and
an application of it in the area of relational database theory. The notions of
a relational database, a query applicable to a relational database, and a
consistent answer to a query with respect to a possibly inconsistent relational
database are considered from the perspective of this logic. This perspective
enables among other things the definition of a consistent answer to a query
with respect to a possibly inconsistent database without resort to database
repairs. In a previous paper, LPQ is presented with a
sequent-style natural deduction proof system. In this paper, a sequent calculus
proof system is presented because it is common to use a sequent calculus proof
system as the basis of proof search procedures and such procedures may form the
core of algorithms for computing consistent answers to queries.Comment: 21 pages; revision of v4, some inaccuracies removed and material
streamlined at several place
A conventional expansion of first-order Belnap-Dunn logic
This paper concerns an expansion of first-order Belnap-Dunn logic named
. Its connectives and quantifiers are all
familiar from classical logic and its logical consequence relation is closely
connected to the one of classical logic. Results that convey this close
connection are established. Classical laws of logical equivalence are used to
distinguish the four-valued logic from all
other four-valued logics with the same connectives and quantifiers whose
logical consequence relation is as closely connected to the logical consequence
relation of classical logic. It is shown that several interesting non-classical
connectives added to Belnap-Dunn logic in its studied expansions are definable
in . It is also established that
is both paraconsistent and paracomplete. A
sequent calculus proof system that is sound and complete with respect to the
logical consequence relation of is
presented.Comment: 28 pages, revision of version v2 with adaptation of Appendix B to
terminology and notations of arXiv:2303.0526