Pith. sign in

REVIEW 1 cited by

Machine Reasoning Explainability

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2009.00418 v2 pith:4LEGLIVS submitted 2020-09-01 cs.AI cs.LO

classification cs.AIcs.LO
keywords explainabilityreasoningexplainablemachinestudieswellworkabstract
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

As a field of AI, Machine Reasoning (MR) uses largely symbolic means to formalize and emulate abstract reasoning. Studies in early MR have notably started inquiries into Explainable AI (XAI) -- arguably one of the biggest concerns today for the AI community. Work on explainable MR as well as on MR approaches to explainability in other areas of AI has continued ever since. It is especially potent in modern MR branches, such as argumentation, constraint and logic programming, planning. We hereby aim to provide a selective overview of MR explainability techniques and studies in hopes that insights from this long track of research will complement well the current XAI landscape. This document reports our work in-progress on MR explainability.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Trustworthy and Explainable Decision-Making for Workforce allocation

    cs.AI 2024-12 conditional novelty 3.0 of 10

    A constraint-programming tool for workforce allocation adds explainable conflict visualization and interactive feasibility restoration via MUS/MCS computation and user-weighted task priorities.

Pith tools