Completed logic programs and their consistency

DOI10.1016/0743-1066(90)90032-ZzbMATH Open0715.68011WikidataQ126849108 ScholiaQ126849108MaRDI QIDQ3201745FDOQ3201745

Taisuke Sato

Publication date: 1990

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Recommendations

• Graph properties for normal logic programs
• scientific article; zbMATH DE number 4176422
• On the existence of stable models of non-stratified logic programs
• On the strong completion of logic programs
• Tight, consistent, and computable completions for unrestricted logic programs

zbMATH Keywords

consistencyCompletionnegative-cycle-freeorder-consistent

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Logic programming (68N17)

Cited In (26)

• Equivalence-preserving first-order unfold/fold transformation systems
• A transformation system for deductive database modules with perfect model semantics
• A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete
• Graph properties for normal logic programs
• Acyclic logic programs and the completeness of SLDNF-resolution
• An alternative approach to the semantics of disjunctive logic programs and deductive databases
• Credolous argumentation with the disjunctive stable semantics
• An abstract, argumentation-theoretic approach to default reasoning
• Synthesis of positive logic programs for checking a class of definitions with infinite quantification
• FC-normal and extended stratified logic program
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
• Title not available (Why is that?)
• An equivalence preserving first order unfold/fold transformation system
• Steadfast logic programs
• Order-consistent programs are cautiously monotonic
• Graph theoretical structures in logic programs and default theories
• Polynomial-time computable stable models
• Updating knowledge bases
• Logic programming and knowledge representation---The A-Prolog perspective
• Completeness and Decidability in Sequence Logic
• Completeness and counter-example generations of a basic protocol logic (extended abstract)
• Tight, consistent, and computable completions for unrestricted logic programs
• Title not available (Why is that?)
• Abduction in logic programming: A new definition and an abductive procedure based on rewriting
• Strict completion of logic programs

This page was built for publication: Completed logic programs and their consistency

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