Logical algorithms

DOI10.1007/3-540-45619-8_15MaRDI QIDQ4809167zbMATH OpenFDO

Authors Harald Ganzinger, David Allen McAllester

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2401/24010209.htm

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Linear Logical Algorithms
• scientific article; zbMATH DE number 4016168
• scientific article; zbMATH DE number 4064461
• scientific article; zbMATH DE number 3938517

Cited in

(14)

• A fast consequence recognition algorithm for monadic logical programs
• Logical approximation for program analysis
• scientific article; zbMATH DE number 3874576 (Why is no real title available?)
• Linear Logical Algorithms
• scientific article; zbMATH DE number 2063222 (Why is no real title available?)
• Meta-complexity theorems: Talk abstract
• Automatic decidability and combinability
• Dynamic Programming Algorithms as Products of Weighted Logic Programs
• scientific article; zbMATH DE number 3227504 (Why is no real title available?)
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• A Survey of the Proof-Theoretic Foundations of Logic Programming
• As time goes by. II: More automatic complexity analysis of concurrent rule programs
• Efficiency of analysis of transitive relations using query-driven, ground-and-solve, and fact-driven inference
• To drive or not to drive: a logical and computational analysis of European transport regulations

This page was built for publication: Logical algorithms

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