Transactions on Large-Scale Data- and Knowledge-Centered Systems XXXIV

Postulates for inconsistency measures are examined, the set of postulates proposed by Hunter and Konieczny being the starting point. The focus is on two postulates that were questioned by various authors. Studying the first suggests a systematic transformation to guard postulates against a certain kind of counter-examples. The second postulate under investigation here is devoted to independence, for which a general version is proposed that avoids the pitfalls mentioned in the literature. Combining these two additions with some postulates previously introduced by the same author, a set of basic postulates alternative to the core set given by Hunter and Konieczny arises. 1 Inconsistency Measures There are plenty of reasons for belief bases to be inconsistent. Unfortunately, inconsistency is a nuisance on a number of counts (it makes deductive reasoning to collapse, it allows decision-making to simultaneaously enforce two mutually exclusive options, . . . ). In short, inconsistency in belief bases is bad. How bad? This is the question that inconsistency measures have been taking seriously. Informally speaking, an inconsistency measure tells to what extent a belief base is inconsistent. Indeed, there seems to be degrees. Consider e.g. the statement “This item is robust and affordable”. One way to contradict it is by means of the statement “If it’s robust then it is not affordable”. Another way is by means of the statement “It is neither robust nor affordable”. The latter expresses that both claims (i.e., “the item is robust” and “the item is affordable”) in the initial statement are false but the former only objects that either “the item is robust” is false or “the item is affordable” is false. Accordingly, the belief base K1 = { This item is robust and affordable If it’s robust then it is not affordable } can be viewed as less inconsistent than the belief base K2 = { This item is robust and affordable It is neither robust nor affordable }

[1]  Jean Lieber,et al.  Semantic wiki engines: a state of the art , 2010 .

[2]  João Marcos Automatic Generation of Proof Tactics for Finite-Valued Logics , 2009, RULE.

[3]  Jef Wijsen,et al.  Database repairing using updates , 2005, TODS.

[4]  Pascal Molli,et al.  Data consistency for P2P collaborative editing , 2006, CSCW '06.

[5]  Raymond Reiter,et al.  What should a database know? , 1988, PODS '88.

[6]  Yasushi Saito,et al.  Optimistic replication , 2005, CSUR.

[7]  Jørgen Villadsen,et al.  First-Order Logic According to Harrison , 2017, Arch. Formal Proofs.

[8]  Anders Schlichtkrull The Resolution Calculus for First-Order Logic , 2016, Arch. Formal Proofs.

[9]  Francesc D. Muñoz-Escoí,et al.  Extending Middleware Protocols for Database Replication with Integrity Support , 2008, OTM Conferences.

[10]  Hala Skaf-Molli,et al.  SWooki, un wiki sémantique sur réseau pair-à-pair , 2009, Ingénierie des Systèmes d Inf..

[11]  Bernhard Thalheim,et al.  Semantics and Pragmatics of Integrity Constraints , 2011, SDKB.

[12]  Raghu Ramakrishnan,et al.  Database Management Systems , 1976 .

[13]  Brian Huffman,et al.  Reasoning with Powerdomains in Isabelle / HOLCF , 2008 .

[14]  Franz Regensburger,et al.  HOLCF: Higher Order Logic of Computable Functions , 1995, TPHOLs.

[15]  Hendrik Decker,et al.  Paraconsistent Computational Logic, This proceedings volume contains the papers presented at the ICLP 2002 workshop Paraconsistent Computational Logic, on July 27, in Copenhagen, Denmark, as part of the Federated Logic Conference (FLoC) , 2002, Paraconsistent Computational Logic.

[16]  Michael J. R. Shave,et al.  Problems of integrity and distributed databases , 1980, Softw. Pract. Exp..

[17]  Matthias Thimm,et al.  On the Compliance of Rationality Postulates for Inconsistency Measures: A More or Less Complete Picture , 2017, KI - Künstliche Intelligenz.

[18]  Robert A. Kowalski,et al.  A Theorem-Proving Approach to Database Integrity , 1988, Foundations of Deductive Databases and Logic Programming..

[19]  Sven Ove Hansson,et al.  Logic of belief revision , 2011 .

[20]  Hala Skaf-Molli,et al.  Multi-synchronous Collaborative Semantic Wikis , 2009, WISE.

[21]  Jørgen Villadsen,et al.  Paraconsistent Assertions , 2004, MATES.

[22]  Jan Chomicki,et al.  Prioritized repairing and consistent query answering in relational databases , 2012, Annals of Mathematics and Artificial Intelligence.

[23]  Leslie Lamport,et al.  How to Write a Proof , 1995 .

[24]  Hendrik Decker,et al.  Integrity Checking and Maintenance in Relational and Deductive Database and Beyond , 2007 .

[25]  Tobias Nipkow,et al.  HOLCF = HOL + LCF , 1999, Journal of Functional Programming.

[26]  Jean-Marie Nicolas Logic for improving integrity checking in relational data bases⋆ , 2004, Acta Informatica.

[27]  S. Gottwald A Treatise on Many-Valued Logics , 2001 .

[28]  Dana S. Scott,et al.  A Type-Theoretical Alternative to ISWIM, CUCH, OWHY , 1993, Theor. Comput. Sci..

[29]  Robin Milner,et al.  Logic for Computable Functions: description of a machine implementation. , 1972 .

[30]  Jef Wijsen,et al.  On condensing database repairs obtained by tuple deletions , 2005, 16th International Workshop on Database and Expert Systems Applications (DEXA'05).

[31]  Robert Hoehndorf,et al.  BOWiki: an ontology-based wiki for annotation of data and integration of knowledge in biology , 2009, BMC Bioinformatics.

[32]  Christoph Benzmüller,et al.  Sweet SIXTEEN: Automation via Embedding into Classical Higher-Order Logic , 2016 .

[33]  Markus Wenzel,et al.  Isar - A Generic Interpretative Approach to Readable Formal Proof Documents , 1999, TPHOLs.

[34]  Charbel Rahhal Semantic Wikis Distributed on Structured Peer-to-Peer Networks , 2017 .

[35]  Tobias Nipkow,et al.  A Proof Assistant for Higher-Order Logic , 2002 .

[36]  Pascal Molli,et al.  Logoot: A Scalable Optimistic Replication Algorithm for Collaborative Editing on P2P Networks , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.

[37]  Xianpei Han,et al.  Semantic Consistency: A Local Subspace Based Method for Distant Supervised Relation Extraction , 2014, ACL.

[38]  Hala Skaf-Molli,et al.  Peer-to-peer Semantic Wikis , 2008 .

[39]  Jørgen Villadsen,et al.  Combinators for Paraconsistent Attitudes , 2001, LACL.

[40]  Jørgen Villadsen,et al.  NaDeA: A Natural Deduction Assistant with a Formalization in Isabelle , 2015, ArXiv.

[41]  Jinzhao Wu,et al.  Semantic Consistency Checking in Building Ontology from Heterogeneous Sources , 2014, J. Appl. Math..

[42]  Tobias Nipkow,et al.  Propositional Proof Systems , 2017, Arch. Formal Proofs.

[43]  Tobias Nipkow,et al.  Concrete Semantics , 2014, Springer International Publishing.

[44]  Kurt Gödel,et al.  On Formally Undecidable Propositions of Principia Mathematica and Related Systems , 1966 .

[45]  Rodney W. Topor,et al.  Safety and Domain Independence , 2009, Encyclopedia of Database Systems.

[46]  Catherine Faron-Zucker,et al.  SweetWiki: A semantic wiki , 2008, J. Web Semant..

[47]  Lawrence C. Paulson,et al.  A MACHINE-ASSISTED PROOF OF GÖDEL’S INCOMPLETENESS THEOREMS FOR THE THEORY OF HEREDITARILY FINITE SETS , 2014, The Review of Symbolic Logic.

[48]  Jørgen Villadsen,et al.  Supra-logic: using transfinite type theory with type variables for paraconsistency , 2005, J. Appl. Non Class. Logics.

[49]  Jørgen Villadsen,et al.  A Paraconsistent Higher Order Logic , 2002, AISC.

[50]  Tom Ridge A Mechanically Verified, Efficient, Sound and Complete Theorem Prover For First Order Logic , 2004, Arch. Formal Proofs.

[51]  L. Lamport How to write a 21st century proof , 2012 .