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 QIDQ4013252

Dirk Vermeir, Els Laenens

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

zbMATH Keywords

well-founded semanticsstable model semanticsordered logic

Mathematics Subject Classification ID

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

Related Items (2)

Abduction in well-founded semantics and generalized stable models via tabled dual programs ⋮ A Free Logic for Stable Models with Partial Intensional Functions

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 bugQ4013252