-ASP for computing repairs with existential ontologies

DOI10.1007/978-3-319-45856-4_16MaRDI QIDQ5268421zbMATH OpenOpenAlexFDO

Authors Jean-François Baget, Zied Bouraoui, Farid Nouioua, Odile Papini, Swan Rocher, Eric Würbel

Publication date 20 June 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-45856-4_16

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• Computing repairs for inconsistent DL-programs over \(\mathcal{EL}\) ontologies
• Computing repairs of inconsistent DL-programs over \(\mathcal{EL}\) ontologies
• Data repair of inconsistent nonmonotonic description logic programs
• An incremental algorithm for computing all repairs in inconsistent knowledge bases
• Towards practical deletion repair of inconsistent DL-programs

Cites work

• A First Order Forward Chaining Approach for Answer Set Computing
• Answer sets for consistent query answering in inconsistent databases
• Extending acyclicity notions for existential rules
• Inconsistency handling in Datalog\(+/-\) ontologies
• Inconsistency-tolerant query answering: rationality properties and computational complexity analysis
• Knowledge Representation, Reasoning and Declarative Problem Solving
• On rules with existential variables: walking the decidability line
• Some syntactic approaches to the handling of inconsistent knowledge bases: A comparative study. I: The flat case
• {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing

Cited in

(8)

• Optimal fixed-premise repairs of \(\mathcal{E}\mathcal{L}\) TBoxes
• A formalism unifying defeasible logics and repair semantics for existential rules
• An incremental algorithm for computing all repairs in inconsistent knowledge bases
• Data repair of inconsistent nonmonotonic description logic programs
• Computing repairs of inconsistent DL-programs over \(\mathcal{EL}\) ontologies
• Computing repairs for inconsistent DL-programs over \(\mathcal{EL}\) ontologies
• Towards practical deletion repair of inconsistent DL-programs
• Tractable closure-based possibilistic repair for partially ordered DL-Lite ontologies

This page was built for publication: \(\exists \)-ASP for computing repairs with existential ontologies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268421)