Epistemic foundation of stable model semantics

DOI10.1017/S1471068405002619MaRDI QIDQ5492048zbMATH OpenOpenAlexWikidataFDO

Authors Yann Loyer, Umberto Straccia

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/s1471068405002619

zbMATH Keywords

BilatticesFixed-point semanticsLogic programsNonmonotonic reasoningStable model semantics

Mathematics Subject Classification ID

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

Recommendations

• Contributions to the stable model semantics of logic programs with negation
• From here to there: Stable negation in logic programming
• Mathematical Foundations of Computer Science 2004
• scientific article; zbMATH DE number 2064303
• Stable models and circumscription

Cited in

(13)

• Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
• Extending and implementing the stable model semantics
• Syntax and semantics of multi-adjoint normal logic programming
• Fuzzy autoepistemic logic and its relation to fuzzy answer set programming
• Any-world assumptions in logic programming
• On the existence and unicity of stable models in normal residuated logic programs
• From fuzzy to annotated semantic web languages
• Solving disjunctive fuzzy answer set programs
• A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption
• Characterizing and extending answer set semantics using possibility theory
• Complexity of fuzzy answer set programming under Łukasiewicz semantics
• Reducing fuzzy answer set programming to model finding in fuzzy logics
• A top-\(k\) query answering procedure for fuzzy logic programming

This page was built for publication: Epistemic foundation of stable model semantics

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