Strict completion of logic programs

DOI10.1007/BF03037151MaRDI QIDQ751309zbMATH OpenOpenAlexFDO

Authors M. Martelli, Włodzimierz Drabent

Publication date 1991

Published in New Generation Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf03037151

zbMATH Keywords

consistencycompletenessnegationcompletionSLDNF-resolution

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• On the strong completion of logic programs
• On completeness of logic programs
• Completed logic programs and their consistency
• Tight, consistent, and computable completions for unrestricted logic programs
• Correctness and completeness of logic programs
• scientific article; zbMATH DE number 4057010
• On strictly arithmetical completeness in logics of programs
• Completion for logically constrained rewriting
• Complete logic programs with domain-closure axiom
• Tight semantics for logic programs

Cites work

• scientific article; zbMATH DE number 3958704 (Why is no real title available?)
• scientific article; zbMATH DE number 1142320 (Why is no real title available?)
• A basis for deductive database systems II
• A completeness theorem for SLDNF resolution
• A kripke-kleene semantics for logic programs*
• Negation as failure. Completeness of the query evaluation process for Horn clause programs with recursive definitions
• Negation as failure. II
• Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
• Negation in logic programming
• RECOGNIZING NON-FLOUNDERING LOGIC PROGRAMS AND GOALS

Cited in

(16)

• What is failure? An approach to constructive negation
• The completeness of SLDNF-resolution with respect to modal completion
• Completions of perpetual logic programs
• Equivalence-preserving first-order unfold/fold transformation systems
• Bottom-up evaluation and query optimization of well-founded models
• On correctness of normal logic programs
• Tight, consistent, and computable completions for unrestricted logic programs
• On Signings and the Well-Founded Semantics
• Predicate Completion for non-Horn Clause Sets
• Completion of first-order clauses with equality by strict superposition
• A Complete Axiomatization of the Three valued Completion of Logic Programs
• Soundness and completeness versus lifting property
• On strictly arithmetical completeness in logics of programs
• On the strong completion of logic programs
• A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses
• scientific article; zbMATH DE number 516997 (Why is no real title available?)

This page was built for publication: Strict completion of logic programs

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