Soft constraints and heuristic constraint correction in entity-relationship modelling

Authors:
Sven Hartmann
Affiliations:
Dept. of Information Systems & Information Science Research Centre, Massey University, Palmerston North, New Zealand
Venue:
Proceedings of the 2nd international conference on Semantics in databases
Year:
2001

Citing 12
Cited 3

Logic for problem-solving

Logic for problem-solving
Negation in logic programming

Journal of Logic Programming
Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Paraconsistent logic programming

Theoretical Computer Science
RI: A logic for reasoning with inconsistency

Proceedings of the Fourth Annual Symposium on Logic in computer science
Logic programming, abduction and probability: a top-down anytime algorithm for estimating prior and posterior probabilities

Selected papers of international conference on Fifth generation computer systems 92
Logic without model theory

What is a logical system?
A survey of paraconsistent semantics for logic programs

Handbook of defeasible reasoning and uncertainty management systems
Flexible Management of Consistency and Availability of Networked Data Replications

FQAS '02 Proceedings of the 5th International Conference on Flexible Query Answering Systems
Drawing Updates From Derivations

ICDT '90 Proceedings of the Third International Conference on Database Theory
Some Notes on Knowledge Assimilation in Deductive Databases

ILPS '97 International Seminar on Logic Databases and the Meaning of Change, Transactions and Change in Logic Databases
A Framework for Representing Knowledge

A Framework for Representing Knowledge

Numerical constraints on XML data

Information and Computation
Efficient reasoning about finite satisfiability of UML class diagrams with constrained generalization sets

ECMDA-FA'07 Proceedings of the 3rd European conference on Model driven architecture-foundations and applications
Consistency of UML class diagrams with hierarchy constraints

NGITS'06 Proceedings of the 6th international conference on Next Generation Information Technologies and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We expose paraconsistent logic with regard to its potential to contribute to the foundations of databases. We do so from a historical perspective, starting at the ancient inception and arriving at the contemporary use of logic as a computational device. We show that an understanding of the logic foundations of databases in terms of paraconsistency is adequate. It avoids absurd connotations of the ex contradictione quodlibet principle, which in fact never applies in databases. We interpret datalog, its origins and some of its extensions by negation and abduction, in terms of paraconsistency. We propose a procedural definition of paraconsistency and show that many well-known query answering procedures comply with it.