Extending negation as failure by abduction: A three-valued stable model semantics

DOI10.1016/0743-1066(95)00065-8zbMath0871.68051OpenAlexW2005752553WikidataQ58207631 ScholiaQ58207631MaRDI QIDQ3128616

M. L. Sapino, Alberto Martelli, Laura Giordano

Publication date: 28 May 1997

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

Full work available at URL: https://doi.org/10.1016/0743-1066(95)00065-8

zbMATH Keywords

finite failure stable model semantics

Mathematics Subject Classification ID

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

Related Items (3)

Abduction in logic programming: A new definition and an abductive procedure based on rewriting ⋮ A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics ⋮ Soundness of abductive proof procedure with respect to constraint for non-ground abducibles

This page was built for publication: Extending negation as failure by abduction: A three-valued stable model semantics