Assumption-free Semantics for Ordered Logic Programs: On the Relationship Between Well-founded and Stable Partial Models

DOI10.1093/LOGCOM/2.2.133zbMATH Open0767.68012OpenAlexW2033106108MaRDI QIDQ4013252FDOQ4013252

Authors: Els Laenens, Dirk Vermeir 

Publication date: 27 September 1992

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

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

Recommendations

• Well-founded semantics and stratification for ordered logic programs
• A Fixpoint Semantics for Ordered Logic
• scientific article; zbMATH DE number 1795986
• Stable models and their computation for logic programming with inheritance and true negation
• The family of stable models

zbMATH Keywords

well-founded semanticsstable model semanticsordered logic

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27)

Cited In (5)

• Abduction in well-founded semantics and generalized stable models via tabled dual programs
• Title not available (Why is that?)
• A Free Logic for Stable Models with Partial Intensional Functions
• The family of stable models
• Answer set semantics for ordered logic programs

This page was built for publication: Assumption-free Semantics for Ordered Logic Programs: On the Relationship Between Well-founded and Stable Partial Models

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