R-stable models for logic programs
From MaRDI portal
Recommendations
Cited in
(27)- Stable models and difference logic
- A note on the stable model semantics for logic programs
- The relationship between stable, supported, default and autoepistemic semantics for general logic programs
- Logic programs, well-orderings, and forward chaining
- Logic programs with stable model semantics as a constraint programming paradigm
- Stable-ordered models for propositional theories with order operators
- On the existence and unicity of stable models in normal residuated logic programs
- Here and there among logics for logic programming
- Stable models of fuzzy propositional formulas
- On the minimality of stable models
- Integrating rules and ontologies in the first-order stable model semantics (preliminary report)
- Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
- On the existence of stable models of non-stratified logic programs
- Approved Models for Normal Logic Programs
- Layer Supported Models of Logic Programs
- Top-down semantics of fair computations of logic programs
- scientific article; zbMATH DE number 1223549 (Why is no real title available?)
- Stable model checking for disjunctive logic programs
- scientific article; zbMATH DE number 7047283 (Why is no real title available?)
- scientific article; zbMATH DE number 1877044 (Why is no real title available?)
- scientific article; zbMATH DE number 1890625 (Why is no real title available?)
- scientific article; zbMATH DE number 845882 (Why is no real title available?)
- scientific article; zbMATH DE number 1453070 (Why is no real title available?)
- Logic programming semantics made easy
- Lloyd-Topor completion and general stable models
- Compactness Properties for Stable Semantics of Logic Programs
- Twelve Definitions of a Stable Model
This page was built for publication: R-stable models for logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375821)