Completed logic programs and their consistency

DOI10.1016/0743-1066(90)90032-ZzbMath0715.68011WikidataQ126849108 ScholiaQ126849108MaRDI QIDQ3201745

Taisuke Sato

Publication date: 1990

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

zbMATH Keywords

consistencyCompletionnegative-cycle-freeorder-consistent

Mathematics Subject Classification ID

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

Related Items (17)

Abduction in logic programming: A new definition and an abductive procedure based on rewriting ⋮ Synthesis of positive logic programs for checking a class of definitions with infinite quantification ⋮ An alternative approach to the semantics of disjunctive logic programs and deductive databases ⋮ Characterizations of stable model semantics for logic programs with arbitrary constraint atoms ⋮ Polynomial-time computable stable models ⋮ An equivalence preserving first order unfold/fold transformation system ⋮ An abstract, argumentation-theoretic approach to default reasoning ⋮ Updating knowledge bases ⋮ Acyclic logic programs and the completeness of SLDNF-resolution ⋮ Graph theoretical structures in logic programs and default theories ⋮ Equivalence-preserving first-order unfold/fold transformation systems ⋮ A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete ⋮ Graph properties for normal logic programs ⋮ A transformation system for deductive database modules with perfect model semantics ⋮ Credolous argumentation with the disjunctive stable semantics ⋮ On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games ⋮ Logic programming and knowledge representation---The A-Prolog perspective

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