Foundations of logic programming
Foundations of logic programming
A decidable class of bounded recursions
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Decidability and expressiveness aspects of logic queries
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Introduction to mathematical logic; (3rd ed.)
Introduction to mathematical logic; (3rd ed.)
Integrity constraint checking in stratified databases
Journal of Logic Programming
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Data functions, datalog and negation
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Foundations of deductive databases and logic programming
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
On domain independent databases
Foundations of deductive databases and logic programming
Foundations of semantic query optimization for deductive databases
Foundations of deductive databases and logic programming
Equivalences of logic programs
Foundations of deductive databases and logic programming
Foundations of deductive databases and logic programming
Inference of monotonicity constraints in datalog programs
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
ACM SIGACT News
Logic programming
Deciding boundedness for uniformly connected Datalog programs
ICDT '90 Proceedings of the third international conference on database theory on Database theory
Modular acyclicity and tail recursion in logic programs
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Independence of logic database queries and update
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Decidability and undecidability results for boundedness of linear recursive queries
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Determining View dependencies using tableaux
ACM Transactions on Database Systems (TODS)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
Horn clauses and database dependencies
Journal of the ACM (JACM)
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Logic and Data Bases
Updating Derived Relations: Detecting Irrelevant and Autonomously Computable Updates
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Semantic data markets: a flexible environment for knowledge management
Proceedings of the 20th ACM international conference on Information and knowledge management
Speeding up the counting method by computing heritage functions in topological order
ADBIS'97 Proceedings of the First East-European conference on Advances in Databases and Information systems
Hi-index | 0.00 |
A program is first-order reducible (FO-reducible) w.r.t. a set IC of integrity constraints if there exists a first-order theory T such that the set of models for T is exactly the set of intended models for the program w.r.t. all possible EDBs. In this case, we say that P is FO-reducible to T w.r.t. IC. For FO-reducible programs, it is possible to characterize, using first-order logic implications, properties of programs that are related to all possible EDBs as in the database context. These properties include, among others, containment of programs, independence of updates w.r.t. queries and integrity constraints, and characterization and implication of integrity constraints in programs, all of which have no known proof procedures. Therefore, many important problems formalized in a nonstandard logic can be dealt with by using the rich reservoir of first-order theorem-proving tools, provided that the program is FO-reducible. The following classes of programs are shown to be FO-reducible: (1) a stratified acyclic program P is FO-reducible to comp(P)/spl cup/IC w.r.t. IC for any set IC of constraints; (2) a general chained program P is FO-reducible to comp(P')/spl cup/IC w.r.t. certain acyclicity constraints IC; and (3) a bounded program P is FO-reducible to comp(P')/spl cup/IC w.r.t. any set IC of constraints, where P' is a nonrecursive program equivalent to P. Some heuristics for constructing FO-reducible programs are described.