Foundations of logic programming
Foundations of logic programming
Implementation of logical query languages for databases
ACM Transactions on Database Systems (TODS)
Dynamic rule support in Prolog
Proc. of the IFIP TC 10 working conference on Fifth generation computer architectures
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Introduction to Formal Language Theory
Introduction to Formal Language Theory
An optimizing prolog front-end to a relational query system
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
Bounds on the propagation of selection into logic programs
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A necessary condition for a doubly recursive rule to be equivalent to a linear recursive rule
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Data functions, datalog and negation
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
A framework for testing safety and effective computability of extended datalog
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
SYGRAF: Implementing Logic Programs in a Database Style
IEEE Transactions on Software Engineering
Decidable optimization problems for database logic programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Safety of datalog queries over infinite databases
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Proof-tree transformation theorems and their applications
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On compile-time query optimization in deductive databases by means of static filtering
ACM Transactions on Database Systems (TODS)
Necessary and sufficient conditions to linearize doubly recursive programs in logic databases
ACM Transactions on Database Systems (TODS)
Hard problems for simple logic programs
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A new paradigm for parallel and distributed rule-processing
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A new proof of undecidability of safety of logic queries
ACM SIGACT News
Towards an algebraic theory of recursion
Journal of the ACM (JACM)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On Datalog vs. polynomial time (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Modular acyclicity and tail recursion in logic programs
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Inference of inequality constraints in logic programs (extended abstracts)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the equivalence of database restructurings involving object identifiers (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the equivalence of recursive and nonrecursive datalog programs
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Constraints and redundancy in datalog
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Datalog expressiveness of chain queries: grammar tools and characterizations
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Equivalence, query-reachability and satisfiability in Datalog extensions
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Undecidable optimization problems for database logic programs
Journal of the ACM (JACM)
Constraint checking with partial information
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Bonded arity Datalog (≠) queries on graphs
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the complexity of equivalence between recursive and nonrecursive Datalog programs
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Universal finiteness and satisfiability (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Space optimization in deductive databases
ACM Transactions on Database Systems (TODS)
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Perspectives on database theory
ACM SIGACT News
Static analysis of intensional databases in U-Datalog (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Answering recursive queries using views
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the decidability and axiomatization of query finiteness in deductive databases
Journal of the ACM (JACM)
On the expressive power of datalog: tools and a case study
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Independence of logic database queries and update
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Non-deterministic languages to express deterministic transformations
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
GraphLog: a visual formalism for real life recursion
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An axiomatic approach to deciding query safety in deductive databases
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Optimizing existential datalog queries
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Static analysis in datalog extensions
Journal of the ACM (JACM)
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Annals of Mathematics and Artificial Intelligence
ACM SIGMOD Record
Classification and Compilation of Linear Recursive Queries in Deductive Databases
IEEE Transactions on Knowledge and Data Engineering
First-Order Logic Characterization of Program Properties
IEEE Transactions on Knowledge and Data Engineering
Linearizing Some Recursive Logic Programs
IEEE Transactions on Knowledge and Data Engineering
Transactions and Updates in Deductive Databases
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Parallel and Distributed Processing of Rules by Data-Reduction
IEEE Transactions on Knowledge and Data Engineering
Answering Queries Using Materialized Views with Disjunctions
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Queries Independent of Updates
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
On the Equivalence of XML Patterns
CL '00 Proceedings of the First International Conference on Computational Logic
On the complexity of single-rule datalog queries
Information and Computation - Special issue: ICC '99
Cerberus: A Context-Aware Security Scheme for Smart Spaces
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
On the content of materialized aggregate views
Journal of Computer and System Sciences - Special issue on PODS 2000
An infrastructure for context-awareness based on first order logic
Personal and Ubiquitous Computing
Generalization of ZYT-linearizability for bilinear datalog programs
Information and Computation
Logic-based web information extraction
ACM SIGMOD Record
On Simplification of Database Integrity Constraints
Fundamenta Informaticae
Complexity results for answer set programming with bounded predicate arities and implications
Annals of Mathematics and Artificial Intelligence
Program Correspondence under the Answer-Set Semantics: The Non-ground Case
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
A middleware for context-aware agents in ubiquitous computing environments
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
An approach to detecting relevant updates to cached data using XML and active databases
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Exploiting irrelevance reasoning to guide problem solving
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Complexity results for checking equivalence of stratified logic programs
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Modular class analysis with DATALOG
SAS'03 Proceedings of the 10th international conference on Static analysis
Datalog programs over infinite databases, revisited
DBPL'07 Proceedings of the 11th international conference on Database programming languages
dRDF: entailment for domain-restricted RDF
ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
Database theory: query languages
Algorithms and theory of computation handbook
Verification of knowledge bases based on containment checking
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Providing user support in Web-of-Things enabled smart spaces
Proceedings of the Second International Workshop on Web of Things
Incremental integrity checking: limitations and possibilities
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Specifying and reasoning about dynamic access-control policies
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Equivalence between extended datalog programs -- a brief survey
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
On the complexity of entailment in existential conjunctive first-order logic with atomic negation
Information and Computation
On Simplification of Database Integrity Constraints
Fundamenta Informaticae
Normal and strong expansion equivalence for argumentation frameworks
Artificial Intelligence
NetKAT: semantic foundations for networks
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Classification of annotation semirings over containment of conjunctive queries
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
This paper addresses some basic problems regarding logic programming based queries over relational databases. We re-examine the query classes H and YE+ defined by Chandra and Harel [2] We define H+ and YE++ which differ from H and YE+ in that the use of equality (=) and inequality (≠) is prohibited. We show that H+ is more expressive than YE++ and that any H+ program can be transformed into an equivalent H+ program containing a single recursive predicate without using the equality or inequality operators. As a corollary we obtain a fixpoint formula characterization of H+ queries.We consider the problems of determining containment, equivalence, and satisfiability of logic based queries. The containment and equivalence problems addressed here extend the work of Aho, Sagiv and Ullman on relational queries [1] and Papadimitrious on Prolog [10]. As corollaries we show that determining safety and literal redundancy are both undecidable problems.