First-order theories for pure Prolog programs with negation

DOI10.1007/BF01270391zbMath0831.68014MaRDI QIDQ1892097

Robert F. Stärk

Publication date: 5 July 1995

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

zbMATH Keywords

completionsemanticsprolog

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17)

Related Items (1)

A transformation of propositional Prolog programs into classical logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mints type deductive calculi for logic programming
• Elementary induction on abstract structures
• Reasoning about termination of pure Prolog programs
• The role of standardising apart in logic programming
• A logical semantics for depth-first Prolog with ground negation
• A mathematical definition of full Prolog
• Completeness of SLDNF-resolution for nonfloundering queries
• Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
• A kripke-kleene semantics for logic programs*
• Negation in logic programming
• Bilattices and the semantics of logic programming
• A Complete Axiomatization of the Three valued Completion of Logic Programs
• The Semantics of Predicate Logic as a Programming Language
• Commonsense axiomatizations for logic programs
• About some symmetries of negation
• Input/Output Dependencies of Normal Logic Programs
• A Completeness Result for SLDNF-Resolution

This page was built for publication: First-order theories for pure Prolog programs with negation