Reasoning with infinite stable models. II: Disjunctive programs
From MaRDI portal
Recommendations
Cited in
(20)- Disjunctive \(LP+\) integrity constraints = stable model semantics.
- Erratum to: ``Reasoning with infinite stable models
- Domain expansion for ASP-programs with external sources
- Embedding functions into disjunctive logic programs
- FDNC: decidable nonmonotonic disjunctive logic programs with function symbols
- Embedding functions into disjunctive logic programs
- Bottom-up computation of perfect models for disjunctive theories
- Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
- A decidable subclass of finitary programs
- On Finitely Recursive Programs
- On finitely recursive programs
- Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs
- Ordered completion for first-order logic programs on finite structures
- Dual-normal logic programs -- the forgotten class
- Stable classes and operator pairs for disjunctive programs
- Expressiveness of logic programs under the general stable model semantics
- One More Decidable Class of Finitely Ground Programs
- Disjunctive logic programs with existential quantification in rule heads
- Computable Functions in ASP: Theory and Implementation
- Reasoning with infinite stable models
This page was built for publication: Reasoning with infinite stable models. II: Disjunctive programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4812969)
