Logic Programming with Focusing Proofs in Linear Logic
From MaRDI portal
Publication:4018167
Recommendations
Cited in
(only showing first 100 items - show all)- Focusing and polarization in linear, intuitionistic, and classical logics
- On linear logic planning and concurrency
- Entailment-based actions for coordination
- Linearizing intuitionistic implication
- Representing scope in intuitionistic deductions
- Permutability of proofs in intuitionistic sequent calculi
- Logic programming in a fragment of intuitionistic linear logic
- Programs with continuations and linear logic
- Proof strategies in linear logic
- On proof normalization in linear logic
- First-order linear logic without modalities is NEXPTIME-hard
- Non-commutative logic. III: Focusing proofs.
- Connection methods in linear logic and proof nets construction
- Cut-elimination for a logic with definitions and induction
- Proof-search in type-theoretic languages: An introduction
- A semantic framework for proof evidence
- Proof certificates for equality reasoning
- Multi-focused proofs with different polarity assignments
- From cut-free calculi to automated deduction: the case of bounded contraction
- Hybrid and subexponential linear logics
- The polarized \(\lambda\)-calculus
- Modularity of proof-nets. Generating the type of a module.
- Focussing and proof construction
- Softness of MALL proof-structures and a correctness criterion with Mix
- MELL in the calculus of structures
- Multimodal linguistic inference
- Logical approximation for program analysis
- A PSPACE-complete fragment of second-order linear logic
- Proof nets for classical logic
- The multiplicative-additive Lambek calculus with subexponential and bracket modalities
- Subformula linking for intuitionistic logic with application to type theory
- Proof search and certificates for evidential transactions
- Game of grounds
- A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems
- Soft subexponentials and multiplexing
- Resourceful program synthesis from graded linear types
- From axioms to synthetic inference rules via focusing
- The sequent calculus of skew monoidal categories
- A focus system for the alternation-free \(\mu \)-calculus
- Coherence via focusing for symmetric skew monoidal categories
- Linear logic in computer science
- First-order automated reasoning with theories: when deduction modulo theory meets practice
- From QBFs to \textsf{MALL} and back via focussing
- A fresh view of linear logic as a logical framework
- Focused proof-search in the logic of bunched implications
- Hypersequent and display calculi -- a unified perspective
- A proof theory for model checking
- An interpretation of CCS into ludics
- Formal meta-level analysis framework for quantum programming languages
- Mechanizing focused linear logic in Coq
- On concurrent behaviors and focusing in linear logic
- Cut elimination for the unified logic
- Structure of proofs and the complexity of cut elimination
- A unified procedure for provability and counter-model generation in minimal implicational logic
- On subexponentials, focusing and modalities in concurrent systems
- Formalized meta-theory of sequent calculi for linear logics
- Parsing/theorem-proving for logical grammar \textit{CatLog3}
- A framework for linear authorization logics
- On the unity of duality
- On structuring proof search for first order linear logic
- Non-commutative proof construction: a constraint-based approach
- Verification of spatial and temporal modalities in biochemical systems
- Proof checking and logic programming
- A proof theoretic view of spatial and temporal dependencies in biochemical systems
- Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols
- Call-By-Push-Value from a Linear Logic Point of View
- Focused and Synthetic Nested Sequents
- Encoding generic judgments: preliminary results
- Hybridizing a logical framework
- Rewritings for polarized multiplicative and exponential proof structures
- Specifying properties of concurrent computations in CLF
- Focused proof search for linear logic in the calculus of structures
- A linear logic programming language for concurrent programming over graph structures
- A proof theoretic study of soft concurrent constraint programming
- Tools for the investigation of substructural and paraconsistent logics
- Foundations for reliable and flexible interactive multimedia scores
- Structural focalization
- A rewriting framework and logic for activities subject to regulations
- Linearity, control effects, and behavioral types
- On the meaning of focalization
- A proposal for broad spectrum proof certificates
- From focalization of logic to the logic of focalization
- Implicational relevance logic is 2-\textsc{ExpTime}-complete
- On structuring proof search for first order linear logic
- Hypersequent rules with restricted contexts for propositional modal logics
- An Indexed System for Multiplicative Additive Polarized Linear Logic
- Focusing in Linear Meta-logic
- From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
- Differential Linear Logic and Polarization
- Axiom Directed Focusing
- Ludics and Its Applications to Natural Language Semantics
- Expanding the Realm of Systematic Proof Theory
- Focalisation and Classical Realisability
- scientific article; zbMATH DE number 4055576 (Why is no real title available?)
- A game semantics for disjunctive logic programming
- Figures of dialogue: a view from ludics
- Algebraic proof theory for substructural logics: cut-elimination and completions
- scientific article; zbMATH DE number 1324432 (Why is no real title available?)
- A Uniform Proof-theoretic Investigation of Linear Logic Programming
- An effective fixpoint semantics for linear logic programs
This page was built for publication: Logic Programming with Focusing Proofs in Linear Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018167)
