Prolog
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Foundations of deductive databases and logic programming
Intensional negation of logic programs: examples and implementation techniques
II and Colloquium on Functional and Logic Programming and Specifications (CFLP) on TAPSOFT '87: Advanced Seminar on Foundations of Innovative Software Development
A Transformation System for Developing Recursive Programs
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Making Exhaustive Search Programs Deterministic
Proceedings of the Third International Conference on Logic Programming
Completeness of the negation as failure rule
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
Predicate logic: a calculus for deriving programs
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 1
A natural programming calculus
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1
Logic program derivation for a class of first order logic relations
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1
A New Technique for Verifying and Correcting Logic Programs
Journal of Automated Reasoning
Program Derivation = Rules + Strategies
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Chain programs for writing deterministic metainterpreters
Theory and Practice of Logic Programming
Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules
Constraint Handling Rules
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Generative modeling with failure in PRISM
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
New advances in logic-based probabilistic modeling by PRISM
Probabilistic inductive logic programming
Negation elimination for finite PCFGs
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
| Hi-index | 0.00 |
We present the first order compiler, a deterministic algorithm that can compile logic programs augmented with universally quantified implicational goals into definite clause programs. It is based on the deductive unfold/fold transformation applied to universal-continuation forms, realization of continuation concept in logic programming. The compiled program is assured to be partially correct wrt the source program.