Semantics in Databases

[1]  Stephen J. Hegner.  Properties of Horn Clauses in Feature-Structure Logic , 1994 .

[2]  V. S. Subrahmanian,et al.  Paraconsistent Logic Programming , 1987, Theor. Comput. Sci..

[3]  Amedeo G. Conte.  Review: Alfred Tarski, Il Concetto di Verita nei Linguaggi Formalizzati; Francesca Rivetti Barbo, Prefazione; Alfred Tarski, Der Wahrheitsbegriff in den Formalisierten Sprachen , 1966 .

[4]  Stephen Cole Kleene,et al.  On notation for ordinal numbers , 1938, Journal of Symbolic Logic.

[5]  Arthur M. Keller.  Set-Theoretic Problems of Null Completion in Relational Databases , 1986, Inf. Process. Lett..

[6]  Maurizio Lenzerini,et al.  On The Satisfiability of Dependency Constraints in Entity-Relationship Schemata , 1987, VLDB.

[7]  William Kent.  Consequences of assuming a universal relation , 1981, TODS.

[8]  Leopoldo E. Bertossi,et al.  Logic Programs for Querying Inconsistent Databases , 2003, PADL.

[9]  Robert A. Kowalski.  Logic without model theory , 1994 .

[10]  Laks V. S. Lakshmanan,et al.  Query Evaluation with Null Values: How Complex is Completeness? , 1989, FSTTCS.

[11]  Sven Hartmann.  Graph-Theoretical Methods to Construct Entity-Relationship Databases , 1995, WG.

[12]  Marianne Winslett,et al.  A model-based belief revision system , 1994, Journal of Automated Reasoning.

[13]  Hendrik Decker,et al.  Some Notes on Knowledge Assimilation in Deductive Databases , 1996, Transactions and Change in Logic Databases.

[14]  Hendrik Decker,et al.  An Extension of SLD by Abduction and Integrity Maintenance for View Updating in Deductive Databases , 1996, Joint International Conference and Symposium on Logic Programming.

[15]  Gerald Pfeifer,et al.  A Deductive System for Non-Monotonic Reasoning , 1997, LPNMR.

[16]  Hans-Joachim Klein.  Efficient Algorithms for Approximating Answers to Queries Against Incomplete Relational Databases , 1999, KRDB.

[17]  Georg Gottlob,et al.  Closed World Databases Opened Through Null Values , 1988, VLDB.

[18]  Ivan A. Sag,et al.  Book Reviews: Head-driven Phrase Structure Grammar and German in Head-driven Phrase-structure Grammar , 1996, CL.

[19]  Stephen J. Hegner.  Computational and Structural Aspects of Openly Specified Type Hierarchies , 1998, LACL.

[20]  Massoud Moussavi,et al.  A six-valued logic for representing incomplete knowledge , 1990, Proceedings of the Twentieth International Symposium on Multiple-Valued Logic.

[21]  Karen L. Kwast,et al.  A deontic approach to database integrity , 1993, Annals of Mathematics and Artificial Intelligence.

[22]  Serge Abiteboul,et al.  On the representation and querying of sets of possible worlds , 1987, SIGMOD '87.

[23]  J. Halpern.  Review: J. A. Robinson, Logic: Form and Function. The Mechanization of Deductive Reasoning , 1986, Journal of Symbolic Logic.

[24]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

[25]  Robert A. Kowalski,et al.  Linear Resolution with Selection Function , 1971, Artif. Intell..

[26]  Diderik Batens,et al.  A survey of inconsistency-adaptive logics , 2000 .

[27]  Jan Chomicki,et al.  Consistent query answers in inconsistent databases , 1999, PODS '99.

[28]  C. J. Date.  Relational Database - Selected Writings , 1986 .

[29]  Frank Dignum,et al.  The Role of Deontic Logic in the Specification of Information Systems , 1998, Logics for Databases and Information Systems.

[30]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[31]  Gabriel M. Kuper,et al.  Updating Logical Databases , 1986, Adv. Comput. Res..

[32]  Professor Dr. Bernhard Thalheim.  Entity-Relationship Modeling , 2000, Springer Berlin Heidelberg.

[33]  Marvin Minsky,et al.  A framework for representing knowledge , 1974 .

[34]  Rina Dechter,et al.  Propositional semantics for disjunctive logic programs , 1994, Annals of Mathematics and Artificial Intelligence.

[35]  E. F. Codd,et al.  Further Normalization of the Data Base Relational Model , 1971, Research Report / RJ / IBM / San Jose, California.

[36]  Antonis C. Kakas,et al.  The role of abduction in logic programming , 1998 .

[37]  Sven Hartmann.  On the Consistency of Int-cardinality Constraints , 1998, ER.

[38]  E. F. Codd,et al.  Relational Completeness of Data Base Sublanguages , 1972, Research Report / RJ / IBM / San Jose, California.

[39]  Bernhard Thalheim,et al.  An Informal and Efficient Approach for Obtaining Semantic Constraints Using Sample Data and Natural Language Processing , 1995, Semantics in Databases.

[40]  Sven Hartmann,et al.  On the implication problem for cardinality constraints and functional dependencies , 2001, Annals of Mathematics and Artificial Intelligence.

[41]  Jan Chomicki,et al.  Consistent Answers from Integrated Data Sources , 2002, FQAS.

[42]  Francesco Buccafurri,et al.  Enhancing Disjunctive Datalog by Constraints , 2000, IEEE Trans. Knowl. Data Eng..

[43]  Dimitri Theodoratos.  Deductive Object Oriented Schemas , 1996, ER.

[44]  Phan Minh Dung,et al.  An Argumentation-Theoretic Foundations for Logic Programming , 1995, J. Log. Program..

[45]  P. Lorenzen.  Einführung in die operative Logik und Mathematik , 1955 .

[46]  Jan Gilbert Van Den Bussche.  Formal aspects of object identity in database manipulation , 1993 .

[47]  A. Goldberg,et al.  A heuristic improvement of the Bellman-Ford algorithm , 1993 .

[48]  Heikki Mannila,et al.  Design of Relational Databases , 1992 .

[49]  Jack Minker,et al.  An Extension to Linear Resolution with Selection Function , 1982, Inf. Process. Lett..

[50]  W. Ackermann,et al.  Grundzüge der theoretischen Logik , 1928 .

[51]  Wolfgang Faber,et al.  Declarative problem-solving in DLV , 2001 .

[52]  Bernhard Thalheim,et al.  Foundations of entity-relationship modeling , 1993, Annals of Mathematics and Artificial Intelligence.

[53]  Michael Kifer,et al.  Applications of Annotated Predicate Calculus to Querying Inconsistent Databases , 2000, Computational Logic.

[54]  Diego Calvanese,et al.  On the interaction between ISA and cardinality constraints , 1994, Proceedings of 1994 IEEE 10th International Conference on Data Engineering.

[55]  Michael Kifer,et al.  A logic for reasoning with inconsistency , 1992, Journal of Automated Reasoning.

[56]  Hans-Joachim Klein.  On the Use of Marked Nulls for the Evaluation of Queries Against Incomplete Relational Databases , 1998, FMLDO.

[57]  W. V. Quine,et al.  Der Minimalkalkul, ein Reduzierter Intutionistischer Formalismus. , 1937 .

[58]  A. Sette,et al.  ON THE PROPOSITIONAL CALCULUS P1. , 1973 .

[59]  Robert A. Kowalski,et al.  Abduction Compared with Negation by Failure , 1989, ICLP.

[60]  Andrew V. Goldberg,et al.  Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.

[61]  Xin He,et al.  Scalar aggregation in inconsistent databases , 2003, Theor. Comput. Sci..

[62]  Bernhard Thalheim,et al.  Fundamental Concepts of Object Oriented Databases , 1993, Acta Cybern..

[63]  Emil L. Post.  Introduction to a General Theory of Elementary Propositions , 1921 .

[64]  Tomasz Imielinski,et al.  A systematic approach to relational database theory , 1982, SIGMOD '82.

[65]  PhD Mark Levene BSc,et al.  A Guided Tour of Relational Databases and Beyond , 1999, Springer London.

[66]  K. Gödel.  Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I , 1931 .

[67]  Tok Wang Ling,et al.  Resolving Constraint Conflicts in the Integration of Entity-Relationship Schemas , 1997, ER.

[68]  V. A. Bazhanov.  Toward the Reconstruction of the Early History of Paraconsistent Logic: The Prerequisites of N.A.Vasiliev's Imaginary Logic , 1998 .

[69]  Gösta Grahne,et al.  The Problem of Incomplete Information in Relational Databases , 1991, Lecture Notes in Computer Science.

[70]  Sven Hartmann.  Coping with Inconsistent Constraint Specifications , 2001, ER.

[71]  Hendrik Decker,et al.  Drawing Updates From Derivations , 1990, ICDT.

[72]  Letizia Tanca,et al.  Dealing with Deviations in DBMSs: An Approach to Revise Consistency Constraints , 1996, FMLDO.

[73]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[74]  C. Damásio,et al.  A survey of paraconsistent semantics for logic programs , 1998 .

[75]  Leopoldo E. Bertossi,et al.  Repairing databases with annotated predicate logic , 2002, NMR.

[76]  Jan Chomicki,et al.  Specifying and Querying Database Repairs using Logic Programs with Exceptions , 2000, FQAS.

[77]  David W. Embley,et al.  Cardinality Constraints in Semantic Data Models , 1993, Data Knowl. Eng..

[78]  Luis Irún-Briz,et al.  Flexible Management of Consistency and Availability of Networked Data Replications , 2002, FQAS.

[79]  Leopoldo E. Bertossi,et al.  Querying Inconsistent Databases: Algorithms and Implementation , 2000, Computational Logic.

[80]  Hendrik Decker,et al.  Integrity Enforcement on Deductive Databases , 1986, Expert Database Conf..