scientific article; zbMATH DE number 2090533

zbMATH Open1045.68038MaRDI QIDQ4812964FDOQ4812964

Brigitte Pientka

Publication date: 12 August 2004

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

Title of this publication is not available (Why is that?)

Recommendations

• Automated Deduction – CADE-20
• Termination proofs for logic programs with tabling
• scientific article; zbMATH DE number 3988745
• Extensional higher-order logic programming
• Extensional higher-order logic programming

Mathematics Subject Classification ID

Logic programming (68N17) Logic in computer science (03B70)

Cited In (9)

• A framework for using knowledge in tableau proofs
• A tableau calculus for Propositional Intuitionistic Logic with a refined treatment of nested implications
• Automated Deduction – CADE-20
• Higher-Order Dynamic Pattern Unification for Dependent Types and Records
• Proof-producing synthesis of ML from higher-order logic
• Title not available (Why is that?)
• Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description)
• Extended ASP Tableaux and rule redundancy in normal logic programs
• A Survey of the Proof-Theoretic Foundations of Logic Programming

Uses Software

• Twelf

This page was built for publication:

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