Expressiveness of Logic Programs under the General Stable Model Semantics

DOI10.1145/3039244zbMath1367.68044arXiv1412.0773OpenAlexW237647712MaRDI QIDQ5278207

Heng Zhang, Yan Zhang

Publication date: 13 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.0773

zbMATH Keywords

complexitysecond-order logicnonmonotonic reasoningexpressivenessanswer set programming

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic programming (68N17)

Uses Software

• ASSAT
• Cmodels
• Datalog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ordered completion for first-order logic programs on finite structures
• Stable models and circumscription
• From answer set logic programming to circumscription via logic of GK
• Loop-separable programs and their first-order definability
• A first order nonmonotonic extension of constructive logic
• ASSAT: computing answer sets of a logic program by SAT solvers
• \(\Sigma_ 1^ 1\)-formulae on finite structures
• Descriptive characterizations of computational complexity
• The polynomial-time hierarchy
• Datalog vs first-order logic
• The expressive powers of the logic programming semantics
• Normal forms for second-order logic over finite structures, and classification of NP optimization problems
• Propositional semantics for disjunctive logic programs
• Some (in)translatability results for normal logic programs and propositional theories
• Universal quantifiers and time complexity of random access machines
• Expressiveness of stable model semantics for disjunctive logic programs with functions
• Subclasses of binary NP
• Disjunctive logic programs with existential quantification in rule heads
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning

This page was built for publication: Expressiveness of Logic Programs under the General Stable Model Semantics