scientific article; zbMATH DE number 978240
From MaRDI portal
Publication:4332416
Recommendations
Cited in
(7)- Reasoning with minimal models: efficient algorithms and applications
- Disjunctive logic programs, answer sets, and the cut rule
- P-log: refinement and a new coherency condition
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
- Solving disjunctive fuzzy answer set programs
- A Generalization of Dung’s Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4332416)