Relaxed Abduction

DOI10.1007/978-3-658-14407-4zbMATH Open1365.68002OpenAlexW4233003478MaRDI QIDQ2970760FDOQ2970760

Thomas Hubauer

Publication date: 30 March 2017

Full work available at URL: https://doi.org/10.1007/978-3-658-14407-4

zbMATH Keywords

algorithmhypergraphontologyorder relationsknowledge representationabductive reasoning

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Knowledge representation (68T30) Hypergraphs (05C65) Logic in artificial intelligence (68T27)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Abductive inference methods in problems of job planning in complex objects 👍 👎
• On computing probabilistic abductive explanations 👍 👎
• Abductively robust inference 👍 👎
• Relational Analysis and Precision via Probabilistic Abstract Interpretation 👍 👎
• Inductive Logic Programming 👍 👎

This page was built for publication: Relaxed Abduction

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