Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
Forum: a multiple-conclusion specification logic
ALP Proceedings of the fourth international conference on Algebraic and logic programming
Gamma and the chemical reaction model: ten years after
Coordination programming
Information and Computation
Cut-elimination for a logic with definitions and induction
Theoretical Computer Science - Special issue on proof-search in type-theoretic languages
A Discipline of Programming
On the complexity analysis of static analyses
Journal of the ACM (JACM)
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
The Structure of Exponentials: Uncovering the Dynamics of Linear Logic Proofs
KGC '93 Proceedings of the Third Kurt Gödel Colloquium on Computational Logic and Proof Theory
A New Meta-complexity Theorem for Bottom-Up Logic Programs
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Monadic concurrent linear logic programming
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
A logical algorithm for ML type inference
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Least and greatest fixed points in linear logic
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
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
Finding unity in computational logic
Proceedings of the 2010 ACM-BCS Visions of Computer Science Conference
Journal of Automated Reasoning
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
Specifying Proof Systems in Linear Logic with Subexponentials
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Complexity of Linear Authorization Logics
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Modeling datalog fact assertion and retraction in linear logic
Proceedings of the 14th symposium on Principles and practice of declarative programming
A formal framework for specifying sequent calculus proof systems
Theoretical Computer Science
A general proof system for modalities in concurrent constraint programming
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
The linear logic exponentials !,? are not canonical: one can add to linear logic other such operators, say !l,?1, which may or may not allow contraction and weakening, and where l is from some pre-ordered set of labels. We shall call these additional operators subexponentials and use them to assign locations to multisets of formulas within a linear logic programming setting. Treating locations as subexponentials greatly increases the algorithmic expressiveness of logic. To illustrate this new expressiveness, we show that focused proof search can be precisely linked to a simple algorithmic specification language that contains while-loops, conditionals, and insertion into and deletion from multisets. We also give some general conditions for when a focused proof step can be executed in constant time. In addition, we propose a new logical connective that allows for the creation of new subexponentials, thereby further augmenting the algorithmic expressiveness of logic.