Linear Logical Algorithms

DOI10.1007/978-3-540-70583-3_28MaRDI QIDQ3519512zbMATH OpenOpenAlexWikidataFDO

Authors Robert J. Simmons, Frank Pfenning

Publication date 19 August 2008

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70583-3_28

zbMATH Keywords

abstract running timebottom-up logic programmingcost semanticsdeductive databasesforward reasoninglinear logic

Mathematics Subject Classification ID

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

Recommendations

• Logical algorithms
• scientific article; zbMATH DE number 1420807
• An effective bottom-up semantics for first-order linear logic programs
• An effective fixpoint semantics for linear logic programs
• Logic programming in a fragment of intuitionistic linear logic

Cited in

(6)

• Logical approximation for program analysis
• An effective bottom-up semantics for first-order linear logic programs
• A complete and terminating execution model for constraint handling rules
• Logical algorithms
• scientific article; zbMATH DE number 1420807 (Why is no real title available?)
• A Survey of the Proof-Theoretic Foundations of Logic Programming

Describes a project that uses

Uses Software

• Datalog

This page was built for publication: Linear Logical Algorithms

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