Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Inductive assertion method for logic programs
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
The automation of syllogistic. II. optimization and complexity issues
Journal of Automated Reasoning
Efficient run-time type checking of typed logic programs
Journal of Logic Programming
Proof methods of declarative properties of definite programs
Theoretical Computer Science
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 Logic for Variable Aliasing in Logic Programs
ALP '94 Proceedings of the 4th International Conference on Algebraic and Logic Programming
Prime Factorizations of Abstract Domains Using First Order Logic
ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
| Hi-index | 0.00 |
In this paper we study a first-order language that allows to express and prove properties reagarding the sharing of variables between non-ground terms and their types. The class of true formulas is proven to be decidable through a procedure of elimination of quantifiers and the language, with its proof procedure, is shown to have interesting applications in validation and debugging of logic programs. An interesting parallel is pointed out between the language of aliasing properties and the first order theories of Boolean algebras.