An introduction to database systems: vol. I (4th ed.)
An introduction to database systems: vol. I (4th ed.)
Logic for problem-solving
Unit Refutations and Horn Sets
Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Logic and Data Bases
The use of semantic information in deductive question-answering systems.
The use of semantic information in deductive question-answering systems.
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
On compiling queries in recursive first-order databases
Journal of the ACM (JACM)
A sound and sometimes complete query evaluation algorithm for relational databases with null values
Journal of the ACM (JACM)
Positivism vs minimalism in deductive databases
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
A model-based approach to updating databases with incomplete information
ACM Transactions on Database Systems (TODS)
Maintaining state constraints in relational databases: a proof theoretic basis
Journal of the ACM (JACM)
Decomposition of relational schemata into components defined by both projection and restriction
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logic and Databases: A Deductive Approach
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Logic-based artificial intelligence
Relative information capacity of simple relational database schemata
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Algebraic aspects of relational database decomposition
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Assumptions in relational database theory
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Decomposition of object-oriented database schemas
Annals of Mathematics and Artificial Intelligence
Managing Reference: Ensuring Referential Integrity of Ontologies for the Semantic Web
EKAW '02 Proceedings of the 13th International Conference on Knowledge Engineering and Knowledge Management. Ontologies and the Semantic Web
Decomposition of Database Classes under Path Functional Dependencies and Onto Constraints
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Extending Classical Logic with Inductive Definitions
CL '00 Proceedings of the First International Conference on Computational Logic
Data bases: A logical perspective
Proceedings of the 1980 workshop on Data abstraction, databases and conceptual modeling
Inducing Multi-Level Association Rules from Multiple Relations
Machine Learning
Measuring inconsistency in knowledgebases
Journal of Intelligent Information Systems
Multistrategy Operators for Relational Learning and Their Cooperation
Fundamenta Informaticae
Verification of Medical Guidelines Using Background Knowledge in Task Networks
IEEE Transactions on Knowledge and Data Engineering
Impacts of logic and databases (invited paper)
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Incremental learning and concept drift in INTHELEX
Intelligent Data Analysis
Foundations and Trends in Web Science
A logic of nonmonotone inductive definitions
ACM Transactions on Computational Logic (TOCL)
Analysing inconsistent first-order knowledgebases
Artificial Intelligence
Notions of Sameness by Default and their Application to Anaphora, Vagueness, and Uncertain Reasoning
Journal of Logic, Language and Information
Building rules on top of ontologies for the semantic web with inductive logic programming
Theory and Practice of Logic Programming
Foundations of Onto-Relational Learning
ILP '08 Proceedings of the 18th international conference on Inductive Logic Programming
Structured knowledge representation for image retrieval
Journal of Artificial Intelligence Research
Monotonicity and persistence in preferential logics
Journal of Artificial Intelligence Research
Spaces of theories with ideal refinement operators
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
OI-implication: soundness and refutation completeness
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Anaphora resolution as equality by default
DAARC'07 Proceedings of the 6th discourse anaphora and anaphor resolution conference on Anaphora: analysis, algorithms and applications
Inductive logic programming in databases: From datalog to $\mathcal{dl}+log}^{\neg\vee}$
Theory and Practice of Logic Programming
Nonmonotonicity and the scope of reasoning: preliminary report
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Answer set programming's contributions to classical logic: an analysis of ASP methodology
Logic programming, knowledge representation, and nonmonotonic reasoning
On representational issues about combinations of classical theories with nonmonotonic rules
KSEM'06 Proceedings of the First international conference on Knowledge Science, Engineering and Management
Principles of inductive reasoning on the semantic web: a framework for learning in AL-log
PPSWR'05 Proceedings of the Third international conference on Principles and Practice of Semantic Web Reasoning
Multistrategy Operators for Relational Learning and Their Cooperation
Fundamenta Informaticae
Deriving Invariants and Constraints from Action Theories
Fundamenta Informaticae
When is naive evaluation possible?
Proceedings of the 32nd symposium on Principles of database systems
A Logic-based Computational Method for the Automated Induction of Fuzzy Ontology Axioms
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
| Hi-index | 0.00 |
A class of first-order databases with no function signs is considered. A closed database DB is one for which the only existing individuals are those explicitly referred to in the formulas of DB. Formally, this is expressed by including in DB a domain closure axiom (x)x = c1 ∨···∨ x = cp, where c1,…,cp are all of the constants occurring in DB. It is shown how to completely capture the effects of this axiom by means of suitable generalizations of the projection and division operators of relational algebra, thereby permitting the underlying theorem prover used for query evaluation to ignore this axiom.A database is E-saturated if all of its constants denote distinct individuals. It is shown that such databases circumvent the usual problems associated with equality, which arise in more general databases.Finally, it is proved for Horn databases and positive queries that only definite answers are obtained, and for databases with infinitely many constants that infinitely long indefinite answers can arise.