Positive dependency graphs revisited

DOI10.1017/S1471068422000333MaRDI QIDQ7027178zbMATH OpenFDO

Authors Jorge Fandinno, Vladimir Lifschitz

Publication date 14 February 2025

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

answer-set programmingcompletionloop formulassplittingstable models

Mathematics Subject Classification ID

Logic programming (68N17) Knowledge representation (68T30)

Cites work

• A generalization of the Lin-Zhao theorem
• Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
• Answer set programming
• ASSAT: computing answer sets of a logic program by SAT solvers
• First-order stable model semantics with intensional functions
• scientific article; zbMATH DE number 1368933 (Why is no real title available?)
• Lloyd-Topor completion and general stable models
• Logic Programming and Nonmonotonic Reasoning
• Logic programs with stable model semantics as a constraint programming paradigm
• Making prolog more expressive
• Stable models and circumscription
• Stable models for infinitary formulas with extensional atoms

This page was built for publication: Positive dependency graphs revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7027178)