N-Prolog and equivalence of logic programs. I

DOI10.1007/BF00172059zbMATH Open0805.68021OpenAlexW1518795075MaRDI QIDQ1314280FDOQ1314280

Authors: Nocola Olivetti, L. Terracini 

Publication date: 26 January 1995

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00172059

Recommendations

• N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure
• N-Prolog: An extension of Prolog with hypothetical implications. I.
• Negation as inconsistency. I
• Modal Logic and Negation as Failure
• First-order theories for pure Prolog programs with negation

zbMATH Keywords

negation as failurelogic programmingthree-valued logiccompletionprogram equivalencemodal semanticsLukasiewicz logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Many-valued logic (03B50) Logic programming (68N17) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Cited In (7)

• N-Prolog: An extension of Prolog with hypothetical implications. I.
• N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure
• First-order theories for pure Prolog programs with negation
• Towards a unified theory of intensional logic programming
• What Is Negation in a System 2020?
• A decision procedure for propositional N-Prolog
• Equivalence of propositional Prolog programs

This page was built for publication: \(N\)-Prolog and equivalence of logic programs. I

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