Theoretical Computer Science
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
Basic proof theory
Forum: a multiple-conclusion specification logic
ALP Proceedings of the fourth international conference on Algebraic and logic programming
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
On structuring proof search for first order linear logic
Theoretical Computer Science
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
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
LJQ: a strongly focused calculus for intuitionistic logic
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Testing concurrent systems: an interpretation of intuitionistic logic
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
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
Focusing and polarization in intuitionistic logic
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Incorporating tables into proofs
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
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
Types for Proofs and Programs
Finding unity in computational logic
Proceedings of the 2010 ACM-BCS Visions of Computer Science Conference
Journal of Automated Reasoning
Proof-theoretic and higher-order extensions of logic programming
A 25-year perspective on logic programming
Classical and intuitionistic subexponential logics are equally expressive
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
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
Reasoning about computations using two-levels of logic
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Specifying Proof Systems in Linear Logic with Subexponentials
Electronic Notes in Theoretical Computer Science (ENTCS)
A proposal for broad spectrum proof certificates
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Agent deliberation via forward and backward chaining in linear logic
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Proceedings of the Fifth Balkan Conference in Informatics
Mechanized semantics for compiler verification
CPP'12 Proceedings of the Second international conference on Certified Programs and Proofs
Compact proof certificates for linear logic
CPP'12 Proceedings of the Second international conference on Certified Programs and Proofs
A formal framework for specifying sequent calculus proof systems
Theoretical Computer Science
A bisimulation between DPLL(T) and a proof-search strategy for the focused sequent calculus
Proceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks & meta-languages: theory & practice
Foundational proof certificates: making proof universal and permanent
Proceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks & meta-languages: theory & practice
Reasoning about higher-order relational specifications
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Foundational proof certificates in first-order logic
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Subformula linking as an interaction method
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Unifying Classical and Intuitionistic Logics for Computational Control
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 5.23 |
A focused proof system provides a normal form to cut-free proofs in which the application of invertible and non-invertible inference rules is structured. Within linear logic, the focused proof system of Andreoli provides an elegant and comprehensive normal form for cut-free proofs. Within intuitionistic and classical logics, there are various different proof systems in the literature that exhibit focusing behavior. These focused proof systems have been applied to both the proof search and the proof normalization approaches to computation. We present a new, focused proof system for intuitionistic logic, called LJF, and show how other intuitionistic proof systems can be mapped into the new system by inserting logical connectives that prematurely stop focusing. We also use LJF to design a focused proof system LKF for classical logic. Our approach to the design and analysis of these systems is based on the completeness of focusing in linear logic and on the notion of polarity that appears in Girard's LC and LU proof systems.