Epistemic foundation of stable model semantics
From MaRDI portal
Publication:5492048
DOI10.1017/S1471068405002619zbMath1110.68070WikidataQ58049285 ScholiaQ58049285MaRDI QIDQ5492048
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
Related Items
Characterizing and extending answer set semantics using possibility theory, Reducing fuzzy answer set programming to model finding in fuzzy logics, Complexity of fuzzy answer set programming under Łukasiewicz semantics, A top-\(k\) query answering procedure for fuzzy logic programming, Approximate well-founded semantics, query answering and generalized normal logic programs over lattices, 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