Isolating resource consumption in linear logic proof search (extended abstract)

MaRDI QIDQ2844805zbMATH OpenFDO

Authors Pablo Lòpez, Ernesto Pimentel, Joshua S. Hodas, Jeffrey Polakow, Lubomira Stoilova

Publication date 19 August 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066104805024

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1948161
• Logic for Programming, Artificial Intelligence, and Reasoning
• Linearity Constraints as Bounded Intervals in Linear Logic Programming
• scientific article; zbMATH DE number 1405458
• Efficient resource management for linear logic proof search

Cited in

(4)

• Towards resource handling in logic programming: The PPL framework and fits semantics
• scientific article; zbMATH DE number 1405458 (Why is no real title available?)
• Linearity Constraints as Bounded Intervals in Linear Logic Programming
• Logic for Programming, Artificial Intelligence, and Reasoning

This page was built for publication: Isolating resource consumption in linear logic proof search (extended abstract)

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