Computationally hard problems for logic programs under answer set semantics
From MaRDI portal
Publication:6636616
DOI10.1145/3676964MaRDI QIDQ6636616FDOQ6636616
Publication date: 12 November 2024
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Cites Work
- ASSAT: computing answer sets of a logic program by SAT solvers
- Nonmonotonic causal theories
- Elements of Information Theory
- Extending and implementing the stable model semantics
- Nested expressions in logic programs
- Title not available (Why is that?)
- Weight constraints as nested expressions
- Title not available (Why is that?)
- Computational Complexity
- A taxonomy of problems with fast parallel algorithms
- Title not available (Why is that?)
- The probabilistic method
- Title not available (Why is that?)
- Computational Complexity
- Boolean function complexity. Advances and frontiers.
- An observation on time-storage trade off
- Logic programs with stable model semantics as a constraint programming paradigm
- Title not available (Why is that?)
- Parity, circuits, and the polynomial-time hierarchy
- Languages that Capture Complexity Classes
- Natural proofs
- On the succinctness of some modal logics
- Title not available (Why is that?)
- Constant Depth Reducibility
- Tight logic programs
- Logic Programming
- Why are there so many loop formulas?
- Nonuniform ACC Circuit Lower Bounds
- Title not available (Why is that?)
- A generalization of the Lin-Zhao theorem
- Logic Programming and Nonmonotonic Reasoning
- Two-Valued Logic Programs
- Knowledge Representation, Reasoning and Declarative Problem Solving
- What is answer set programming to propositional satisfiability
- Answer Set Programming
- On elementary loops of logic programs
- Logic Programming and Nonmonotonic Reasoning
This page was built for publication: Computationally hard problems for logic programs under answer set semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636616)
