Equivalence of well-founded and stable semantics

DOI10.1016/0743-1066(94)90002-7zbMath0812.68086OpenAlexW2036353487MaRDI QIDQ4311649

F. Gire

Publication date: 30 October 1994

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

Full work available at URL: https://doi.org/10.1016/0743-1066(94)90002-7

zbMATH Keywords

semanticsorder-consistent programs

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (1)

Soundness of abductive proof procedure with respect to constraint for non-ground abducibles

This page was built for publication: Equivalence of well-founded and stable semantics