Disjunctive logic programs with existential quantification in rule heads

DOI10.1017/S1471068413000355zbMath1314.68100OpenAlexW2113835981MaRDI QIDQ5398295

Heng Zhang, Yan Zhang, Jia-Huai You

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

zbMATH Keywords

disjunctive logic programsexistential quantificationgeneral stable models

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (2)

Expressiveness of Logic Programs under the General Stable Model Semantics ⋮ Querying incomplete information in RDF with SPARQL

Cites Work

• Towards more expressive ontology languages: the query answering problem
• Stable models and circumscription
• From answer set logic programming to circumscription via logic of GK
• Data exchange: semantics and query answering
• 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
• Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues
• The DLV system for knowledge representation and reasoning

This page was built for publication: Disjunctive logic programs with existential quantification in rule heads