Logic programming as constructivism: a formalization and its application to databases

Authors:
F. Bry
Affiliations:
ECRC, Arabellastr. 17,8000 München 81, West Germany
Venue:
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Year:
1989

Citing 21
Cited 15

Foundations of logic programming

Foundations of logic programming
Negation as inconsistency .I

Journal of Logic Programming
A basis for deductive database systems. II

Journal of Logic Programming
A constructive view of prolog

Journal of Logic Programming
OLD resolution with tabulation

Proceedings on Third international conference on logic programming
Magic sets and other strange ways to implement logic programs (extended abstract)

PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
The Alexander method-a technique for the processing of recursive axioms in deductive databases

New Generation Computing
On the power of magic

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Safety and correct translation of relational calculus formulas

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Negation in logic programming

Foundations of deductive databases and logic programming
Towards a theory of declarative knowledge

Foundations of deductive databases and logic programming
Negation as failure using tight derivations for general logic programs

Foundations of deductive databases and logic programming
On the declarative semantics of deductive databases and logic programs

Foundations of deductive databases and logic programming
Every logic program has a natural stratification and an iterated least fixed point model

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas

Journal of the ACM (JACM)
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
Principles of Database Systems

Principles of Database Systems
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
Horn clauses and database dependencies (Extended Abstract)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing

Every logic program has a natural stratification and an iterated least fixed point model

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The well-founded semantics for general logic programs

Journal of the ACM (JACM)
A three-valued semantics for deductive databases and logic programs

Journal of Computer and System Sciences
Modular stratification and magic sets for Datalog programs with negation

Journal of the ACM (JACM)
Modular stratification and magic sets for DATALOG programs with negation

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Three-valued formalization of logic programming: is it needed?

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Backward chaining evaluation in stratified disjunctive theories

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The expressive powers of the logic programming semantics (extended abstract)

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The CORAL deductive system

The VLDB Journal — The International Journal on Very Large Data Bases - Prototypes of deductive database systems
What You Always Wanted to Know About Datalog (And Never Dared to Ask)

IEEE Transactions on Knowledge and Data Engineering
Efficient Computation of the Well-Founded Model Using Update Propagation

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Soft stratification for magic set based query evaluation in deductive databases

Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Super logic programs

ACM Transactions on Computational Logic (TOCL)
Transformation-based bottom-up computation of the well-founded model

Theory and Practice of Logic Programming
Win-move is coordination-free (sometimes)

Proceedings of the 15th International Conference on Database Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The features of logic programming that seem unconventional from the viewpoint of classical logic can be explained in terms of constructivistic logic. We motivate and propose a constructivistic proof theory of non-Horn logic programming. Then, we apply this formalization for establishing results of practical interest. First, we show that 'stratification' can be motivated in a simple and intuitive way. Relying on similar motivations, we introduce the larger classes of 'loosely stratified' and 'constructively consistent' programs. Second, we give a formal basis for introducing quantifiers into queries and logic programs by defining 'constructively domain independent' formulas. Third, we extend the Generalized Magic Sets procedure to loosely stratified and constructively consistent programs, by relying on a 'conditional fixpoint' procedure.