Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Efficient implementation of a linear logic programming language
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
The focused inverse method for linear logic
The focused inverse method for linear logic
A Logical Characterization of Forward and Backward Chaining in the Inverse Method
Journal of Automated Reasoning
Focusing Strategies in the Sequent Calculus of Synthetic Connectives
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Focusing and polarization in linear, intuitionistic, and classical logics
Theoretical Computer Science
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
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
A proposal for broad spectrum proof certificates
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
From proofs to focused proofs: a modular proof of focalization in linear logic
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
Linear logic is increasingly being used as a tool for communicating reasoning agents in domains such as authorization, access control, electronic voting, etc., where proof certificates represent evidence that must be verified by proof consumers as part of higher protocols. Controlling the size of these certificates is critical. We assume that the proof consumer is allowed to do some search to reconstruct details of the full proof that are omitted from the certificates. Because the decision problem for linear logic is unsolvable, the certificate must contain at least enough information to bound the search: we show how to use the sequence of contractions in the sequent proof for this bound. The remaining content of the proof, in particular the information about resource divisions, can then be omitted from the certificate. We also describe a technique for giving a variable amount of additional search hints to the proof consumer to limit its non-determinism.