A topological characterization of the stable and minimal model classes of propositional logic programs

DOI10.1007/BF01536400zbMath0858.68017MaRDI QIDQ1924782

Audrey P. Ferry

Publication date: 20 October 1996

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

arithmetic hierarchypropositional general logic program

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• How complicated is the set of stable models of a recursive logic program?
• A theory of nonmonotonic rule systems. II
• Unnamed Item

This page was built for publication: A topological characterization of the stable and minimal model classes of propositional logic programs