Linearity Constraints as Bounded Intervals in Linear Logic Programming

DOI10.1093/LOGCOM/EXI073zbMATH Open1120.03020OpenAlexW2020131921MaRDI QIDQ5488612FDOQ5488612

Authors: Jeff Polakow 

Publication date: 22 September 2006

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exi073

Recommendations

• scientific article; zbMATH DE number 1948161
• Logic for Programming, Artificial Intelligence, and Reasoning
• Isolating resource consumption in linear logic proof search (extended abstract)
• Efficient resource management for linear logic proof search
• Bounded Linear Logic, Revisited

zbMATH Keywords

resource managementproof searchlinear logic programming

Mathematics Subject Classification ID

Logic programming (68N17) Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Cited In (5)

• Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax
• Title not available (Why is that?)
• Isolating resource consumption in linear logic proof search (extended abstract)
• Logic for Programming, Artificial Intelligence, and Reasoning
• Improving IntSat by expressing disjunctions of bounds as linear constraints

Uses Software

• Twelf

This page was built for publication: Linearity Constraints as Bounded Intervals in Linear Logic Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488612)