Stepwise debugging of description-logic programs
From MaRDI portal
Publication:2900544
DOI10.1007/978-3-642-30743-0_34zbMATH Open1357.68039OpenAlexW174434031MaRDI QIDQ2900544FDOQ2900544
Authors: Johannes Oetsch, Jörg Pührer, Hans Tompits 
Publication date: 23 July 2012
Published in: Correct Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-30743-0_34
Recommendations
Cites Work
- Combining answer set programming with description logics for the semantic web
- Title not available (Why is that?)
- Semantics and complexity of recursive aggregates in answer set programming
- Title not available (Why is that?)
- Tractable reasoning with DL-programs over Datalog-rewritable description logics
- Stepping through an answer-set program
- Catching the Ouroboros: on debugging non-ground answer-set programs
- Debugging ASP Programs by Means of ASP
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- The loop formula based semantics of description logic programs
- Logic programs with abstract constraint atoms: the role of computations
- Justifications for logic programs under answer set semantics
- Logic Programming and Nonmonotonic Reasoning
Cited In (5)
This page was built for publication: Stepwise debugging of description-logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2900544)
