The following pages link to The family of stable models (Q4275258):
Displaying 23 items.
- Combining explicit negation and negation by failure via Belnap's logic (Q673380) (← links)
- Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (Q1039575) (← links)
- The value of the four values (Q1274293) (← links)
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation (Q1363783) (← links)
- A theory of truth that prefers falsehood (Q1366760) (← links)
- Fixpoint semantics for logic programming a survey (Q1605173) (← links)
- Four-valued paradefinite logics (Q1685565) (← links)
- An encompassing framework for paraconsistent logic programs (Q1775864) (← links)
- Syntax and semantics of multi-adjoint normal logic programming (Q1795198) (← links)
- Parametrized semantics of logic programs -- a unifying framework (Q1884892) (← links)
- Galois connections for bilattices (Q2036385) (← links)
- The logic of generalized truth values and the logic of bilattices (Q2350215) (← links)
- Any-world assumptions in logic programming (Q2566297) (← links)
- On the existence and unicity of stable models in normal residuated logic programs (Q2887039) (← links)
- Truth versus information in logic programming (Q2933087) (← links)
- From Fuzzy to Annotated Semantic Web Languages (Q2970305) (← links)
- Bipolarity in bilattice logics (Q3537542) (← links)
- Introduction: Non-classical Logics—Between Semantics and Proof Theory (In Relation to Arnon Avron’s Work) (Q5020161) (← links)
- Passive and active rules in deductive databases (Q5096897) (← links)
- Annotated revision specification programs (Q5101447) (← links)
- Default consequence relations as a logical framework for logic programs (Q5101454) (← links)
- Stable classes and operator pairs for disjunctive programs (Q5101462) (← links)
- Stability, Supportedness, Minimality and Kleene Answer Set Programs (Q5172611) (← links)
