Computing minimal models, stable models and answer sets

DOI10.1017/S1471068405002607zbMath1110.68022OpenAlexW2127802329MaRDI QIDQ5492049

Zbigniew Lonc, Miroslaw Truszczynski

Publication date: 12 October 2006

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1471068405002607

zbMATH Keywords

minimal modelsdisjunctive logic programsstable modelsanswer sets

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (7)

Counting Maximal Independent Sets in Subcubic Graphs ⋮ On the tractability of minimal model computation for some CNF theories ⋮ Stability, Supportedness, Minimality and Kleene Answer Set Programs ⋮ A Logic-Based Framework Leveraging Neural Networks for Studying the Evolution of Neurological Disorders ⋮ Counting Independent Sets in Claw-Free Graphs ⋮ Quo Vadis Answer Set Programming? ⋮ Graph-based construction of minimal models

This page was built for publication: Computing minimal models, stable models and answer sets