Two-literal logic programs and satisfiability representation of stable models: A comparison
From MaRDI portal
Recommendations
Cited in
(6)- Compact translations of non-disjunctive answer set programs to propositional clauses
- Computing Stable Models via Reductions to Difference Logic
- Random logic programs: linear model
- A model for phase transition of random answer-set programs
- On computing logic programs
- ASSAT: computing answer sets of a logic program by SAT solvers
This page was built for publication: Two-literal logic programs and satisfiability representation of stable models: A comparison
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4739121)