Resultant semantics for prolog

DOI10.1093/LOGCOM/6.4.491zbMATH Open0856.68038OpenAlexW2120913343MaRDI QIDQ4895546FDOQ4895546

Authors: Maurizio Gabbrielli, Maria Chiara Meo, Giorgio Levi 

Publication date: 17 February 1997

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/6.4.491

Recommendations

• A fixed point semantics for logic programs extended with cuts
• scientific article; zbMATH DE number 823595
• Semantics for logic programs without occur check
• scientific article; zbMATH DE number 52709

zbMATH Keywords

logic programming theory

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (6)

• Correct answers for first order logic
• The reduced relative power operation on abstract domains
• A theory of observables for logic programs
• Compositionality properties of SLD-derivations
• An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
• Abstract interpretation of resolution-based semantics

This page was built for publication: Resultant semantics for prolog

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