Quantitative deduction and its fixpoint theory
Journal of Logic Programming
Negation and control in Prolog
Negation and control in Prolog
Theoretical Computer Science
A formulae-as-type notion of control
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Games and full completeness for multiplicative linear logic
Journal of Symbolic Logic
On full abstraction for PCF: I, II, and III
Information and Computation
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
A Game Semantics Foundation for Logic Programming (Extended Abstract)
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
Designs, Disputes and Strategies
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
A Neutral Approach to Proof and Refutation in MALL
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
A Game Semantics for Proof Search: Preliminary Results
Electronic Notes in Theoretical Computer Science (ENTCS)
Playing logic programs with the alpha-beta algorithm
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
| Hi-index | 0.00 |
Girard [1] introduced Ludics as an interactive theory aiming at overcoming the distinction between syntax and semantics in logic. In this paper, we investigate how ludics could serve as a foundation for logic programming, providing a mechanism for interactive proof search, that is proof search by interaction (or proof search by cut-elimination).