CUT-PROPERTY AND NEGATION AS FAILURE

DOI10.1142/S0129054194000086MaRDI QIDQ4327838zbMATH OpenOpenAlexFDO

Authors Robert F. Stärk

Publication date 11 July 1995

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054194000086

zbMATH Keywords

logic programmingnegation-of-failureproof theory

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 515746
• scientific article; zbMATH DE number 879002
• A sound and complete semantics for a version of negation as failure
• ON THE PROPOSITIONAL SLDNF-RESOLUTION
• Negation as failure as resolution

Cited in

(7)

• Cut-elimination for a logic with definitions and induction
• A sound and complete semantics for a version of negation as failure
• ON THE PROPOSITIONAL SLDNF-RESOLUTION
• Extending negation as failure by abduction: A three-valued stable model semantics
• scientific article; zbMATH DE number 956484 (Why is no real title available?)
• scientific article; zbMATH DE number 515746 (Why is no real title available?)
• Proof-theoretic notions for software maintenance

This page was built for publication: CUT-PROPERTY AND NEGATION AS FAILURE

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