Deterministic and non-deterministic stable models
From MaRDI portal
Recommendations
- Deterministic models and identification of their parameters
- scientific article; zbMATH DE number 800808
- Deterministic in contrast to stochastic modeling
- Stable models and circumscription
- scientific article; zbMATH DE number 5251015
- On stability in finite models
- Models for some stochastic systems
- scientific article; zbMATH DE number 749929
- Simultaneous modeling of nonlinear deterministic and stochastic dynamics
Cited in
(14)- Expressive power and complexity of partial models for disjunctive deductive databases
- Multiple total stable models are definitely needed to solve unique solution problems
- Polynomial-time computable stable models
- Complexity and expressive power of deterministic semantics for DATALOG^ .
- Functional queries in datalog
- A description of autostable models
- Deterministic models and identification of their parameters
- P-stable models of strong kernel programs
- Stable models are generated by a stable chain
- scientific article; zbMATH DE number 800808 (Why is no real title available?)
- Approximating operators and semantics for abstract dialectical frameworks
- A claim-centric perspective on abstract argumentation semantics: claim-defeat, principles, and expressiveness
- A non-ground realization of the stable and well-founded semantics
- Fundamental properties of deterministic and nondeterministic extensions of Datalog
This page was built for publication: Deterministic and non-deterministic stable models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4365319)
