Complete logic programs with domain-closure axiom
From MaRDI portal
Publication:3789103
DOI10.1016/0743-1066(88)90013-1zbMath0645.68099WikidataQ114683457 ScholiaQ114683457MaRDI QIDQ3789103
Dino Pedreschi, Simone Martini, Paolo Mancarella
Publication date: 1988
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0743-1066(88)90013-1
inference rule; logic programming; SLD-resolution; negation as failure; domain-closure axiom; proof by case analysis
Related Items
Programming in three-valued logic, Negation by default and unstratifiable logic programs, Compositional model-theoretic semantics for logic programs, Completeness issues in RUE-NRF deduction: The undecidability of viability, What is failure? An approach to constructive negation, Quantifier elimination for infinite terms