Polynomial agorithms for BR-nets and for a fragment of Girard's Linear Logic (original) (raw)
Related papers
Linear Logic for Nets with Bounded Resources
Annals of Pure and Applied Logic, 1996
Linear logic with fixed resources
Dmitri Archangelsky, Dmitry Archangelsky
A Fragment of Dependence Logic Capturing Polynomial Time
Johannes Ebbing, Juha Kontinen
Logical Methods in Computer Science, 2014
Polynomial and Exponential Bounded Logic Programs with Function Symbols: Some New Decidable Classes
Journal of Artificial Intelligence Research
Bounded linear logic: a modular approach to polynomial-time computability
Theoretical computer science, 1992
Polynomially graded logic I. A graded version of system T
[1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, 1989
Decision Problems for Propositional Linear Logic
1990
2005
The Complexity of Generalized Satisfiability for Linear Temporal Logic
Electronic Colloquium on Computational Complexity, 2006
Hybrid Logics and NP Graph Properties
Lecture Notes in Computer Science, 2011
On the computational complexity of satisfiability in propositional logics of programs
Theoretical Computer Science, 1982
A Modal View on Resource-Bounded Propositional Logics
Studia Logica
Polynomially solvable satisfiability problems* 1
Information Processing Letters, 1988
Polynomially solvable satisfiability problems
Information Processing Letters, 1988
On the system CL12 of computability logic
Logical Methods in Computer Science, 2015
Decidability and Complexity of Some Finitely-valued Dynamic Logics
Proceedings of the Eighteenth International Conference on Principles of Knowledge Representation and Reasoning, 2021
Complexity results for quantified boolean formulae based on complete propositional languages
Florian Letombe, Pierre Marquis
2006
A Uniform Proof-Theoretic Investigation of Linear Logic Programming
Journal of Logic and Computation, 1994
Unique perfect matchings, edge-colored graphs and proof nets for linear logic with Mix
2020
Discrete Applied Mathematics, 1990
Algebraic system nets for modelling distributed algorithms
From truth to computability II
Theoretical Computer Science, 2007
Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets
Lecture Notes in Computer Science, 2009
On the Expressive Power of Existential Quantification in Polynomial-Time Computability
2000
An Algebraic Semantics for Hierarchical P/T Nets (Extended Abstract)
1999
A New Correctness Criterion for Cyclic Proof Nets
Journal of Logic, Language and Information, 1998
Complexity of computing with extended propositional logic programs
Annals of Mathematics and Artificial Intelligence, 1995
Characterising equilibrium logic and nested logic programs: Reductions and complexity
Theory and Practice of Logic Programming, 2009
Propositional computability logic I
ACM Transactions on Computational Logic, 2006