The family of stable models

DOI10.1016/0743-1066(93)90031-BzbMath0798.68096OpenAlexW1979129485MaRDI QIDQ4275258

Melvin Fitting

Publication date: 31 October 1994

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-1066(93)90031-b

zbMATH Keywords

stable modelslogic programstable model semanticswell-founded model semantics

Mathematics Subject Classification ID

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

Related Items (23)

On the existence and unicity of stable models in normal residuated logic programs ⋮ Parametrized semantics of logic programs -- a unifying framework ⋮ Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation ⋮ A theory of truth that prefers falsehood ⋮ Truth versus information in logic programming ⋮ Passive and active rules in deductive databases ⋮ Four-valued paradefinite logics ⋮ Annotated revision specification programs ⋮ Default consequence relations as a logical framework for logic programs ⋮ Stable classes and operator pairs for disjunctive programs ⋮ From Fuzzy to Annotated Semantic Web Languages ⋮ Bipolarity in bilattice logics ⋮ Combining explicit negation and negation by failure via Belnap's logic ⋮ Stability, Supportedness, Minimality and Kleene Answer Set Programs ⋮ An encompassing framework for paraconsistent logic programs ⋮ Galois connections for bilattices ⋮ Syntax and semantics of multi-adjoint normal logic programming ⋮ The value of the four values ⋮ Approximate well-founded semantics, query answering and generalized normal logic programs over lattices ⋮ Any-world assumptions in logic programming ⋮ Introduction: Non-classical Logics—Between Semantics and Proof Theory (In Relation to Arnon Avron’s Work) ⋮ The logic of generalized truth values and the logic of bilattices ⋮ Fixpoint semantics for logic programming a survey

This page was built for publication: The family of stable models