PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Handbook of theoretical computer science (vol. B)
Proof methods of declarative properties of definite programs
Theoretical Computer Science
Reasoning about termination of pure Prolog programs
Information and Computation
Declarative programming in Prolog
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Modular termination proofs for logic and pure PROLOG programs
Advances in logic programming theory
Program verification and Prolog
Specification and validation methods
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Verifying Correctness of Logic Programs
TAPSOFT '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages
A closer look at declarative interpretations
A closer look at declarative interpretations
Magically constraining the inverse method using dynamic polarity assignment
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
| Hi-index | 0.00 |
In this paper, we combine a novel method for proving partial correctness of logic programs with a known method for proving termination, and apply them to the study of the magic-sets transformation. As a result, a declarative reconstruction of efficient bottom-up execution of goal-driven deduction is accomplished, in the sense that the obtained results of partial and total correctness of the transformation abstract away from procedural semantics.