Disjunctive logic programs with existential quantification in rule heads
From MaRDI portal
Publication:5398295
DOI10.1017/S1471068413000355zbMATH Open1314.68100OpenAlexW2113835981MaRDI QIDQ5398295FDOQ5398295
Authors: Jia-Huai You, Heng Zhang, Yan Zhang 
Publication date: 27 February 2014
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1471068413000355
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
Logic programming (68N17) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)
Cites Work
- Disjunctive Datalog with existential quantifiers: semantics, decidability, and complexity issues
- The DLV system for knowledge representation and reasoning
- Remarks on Berger's paper on the domino problem
- Data exchange: semantics and query answering
- Logic programs with stable model semantics as a constraint programming paradigm
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- Stable models and circumscription
- Towards more expressive ontology languages: the query answering problem
- From answer set logic programming to circumscription via logic of GK
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)
