Complete logic programs with domain-closure axiom

DOI10.1016/0743-1066(88)90013-1zbMath0645.68099OpenAlexW2025406423WikidataQ114683457 ScholiaQ114683457MaRDI QIDQ3789103

Simone Martini, Dino Pedreschi, 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

zbMATH Keywords

inference rulelogic programmingSLD-resolutionnegation as failuredomain-closure axiomproof by case analysis

Mathematics Subject Classification ID

Related Items (6)

What is failure? An approach to constructive negation ⋮ Compositional model-theoretic semantics for logic programs ⋮ Quantifier elimination for infinite terms ⋮ Programming in three-valued logic ⋮ Negation by default and unstratifiable logic programs ⋮ Completeness issues in RUE-NRF deduction: The undecidability of viability

This page was built for publication: Complete logic programs with domain-closure axiom