Resolution for skeptical stable model semantics

DOI10.1023/A:1011960831261zbMath0991.03016OpenAlexW1536278125MaRDI QIDQ5956119

Piero A. Bonatti

Publication date: 11 April 2002

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011960831261

zbMATH Keywords

resolutionnonmonotonic reasoningflounderingskeptical derivationsstable semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mechanization of proofs and logical operations (03B35) Logic programming (68N17)

Related Items (5)

Erratum to: ``Reasoning with infinite stable models ⋮ Fifty Years of Prolog and Beyond ⋮ Complexity results for answer set programming with bounded predicate arities and implications ⋮ On finitely recursive programs ⋮ Reasoning with infinite stable models

Uses Software

• Smodels

This page was built for publication: Resolution for skeptical stable model semantics