Epistemic foundation of stable model semantics

DOI10.1017/S1471068405002619zbMath1110.68070OpenAlexW2158350199WikidataQ58049285 ScholiaQ58049285MaRDI QIDQ5492048

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

Nonmonotonic reasoningBilatticesStable model semanticsLogic programsFixed-point semantics

Mathematics Subject Classification ID

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

Related Items (12)

On the existence and unicity of stable models in normal residuated logic programs ⋮ Solving Disjunctive Fuzzy Answer Set Programs ⋮ Characterizing and extending answer set semantics using possibility theory ⋮ From Fuzzy to Annotated Semantic Web Languages ⋮ A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption ⋮ 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 ⋮ Syntax and semantics of multi-adjoint normal logic programming ⋮ Approximate well-founded semantics, query answering and generalized normal logic programs over lattices ⋮ Any-world assumptions in logic programming ⋮ Fuzzy autoepistemic logic and its relation to fuzzy answer set programming

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