Disjunctive logic programs with existential quantification in rule heads
From MaRDI portal
Publication:5398295
Recommendations
- Disjunctive Datalog with existential quantifiers: semantics, decidability, and complexity issues
- scientific article; zbMATH DE number 25192
- scientific article; zbMATH DE number 4200183
- scientific article; zbMATH DE number 2090537
- Expressiveness of stable model semantics for disjunctive logic programs with functions
Cites work
- Data exchange: semantics and query answering
- Disjunctive Datalog with existential quantifiers: semantics, decidability, and complexity issues
- From answer set logic programming to circumscription via logic of GK
- Logic programs with stable model semantics as a constraint programming paradigm
- Remarks on Berger's paper on the domino problem
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- Stable models and circumscription
- The DLV system for knowledge representation and reasoning
- Towards more expressive ontology languages: the query answering problem
Cited in
(3)
This page was built for publication: Disjunctive logic programs with existential quantification in rule heads
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5398295)