The consistency of negation as failure

DOI10.1016/0743-1066(86)90017-8zbMath0598.68064OpenAlexW2064581668MaRDI QIDQ3732985

Tim Flannagan

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0743-1066(86)90017-8

zbMATH Keywords

logic programmingclosed world assumptioncompleted databasequery evaluation process

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Information storage and retrieval of data (68P20) General topics in the theory of software (68N01)

Related Items (3)

Sémantique logique et dénotationnelle des interpréteurs PROLOG ⋮ Stable and extension class theory for logic programs and default logics ⋮ A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete

This page was built for publication: The consistency of negation as failure