Stepwise Debugging of Description-Logic Programs

DOI10.1007/978-3-642-30743-0_34zbMATH Open1357.68039OpenAlexW174434031MaRDI QIDQ2900544FDOQ2900544

Hans Tompits, Jörg Pührer, Johannes Oetsch

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Combining answer set programming with description logics for the semantic web
• Semantics and complexity of recursive aggregates in answer set programming
• 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 (3)

• Semi-equilibrium models for paracoherent answer set programs
• Stepwise debugging of answer-set programs
• Data repair of inconsistent nonmonotonic description logic programs

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)