MétaCan
Menu
Back to cohort
Record W2142128908

Automata-Based Abduction for Tractable Diagnosis.

2010· article· en· W2142128908 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

aboutThe title or abstract carries a Canadian signal from the geographic lexicon.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueDescription Logics · 2010
Typearticle
Languageen
FieldComputer Science
TopicSemantic Web and Ontologies
Canadian institutionsnot available
Fundersnot available
KeywordsComputer scienceInferenceAbductive reasoningAxiomDomain (mathematical analysis)Theoretical computer scienceComplete informationAutomatonArtificial intelligenceNon-monotonic logicRepresentation (politics)Interpretation (philosophy)Monotonic functionMachine learningProgramming languageMathematical economicsMathematics
DOInot available

Abstract

fetched live from OpenAlex

Abductive reasoning has been recognized as a valuable com- plement to deductive inference for tasks such as diagnosis and integration of incomplete information despite its inherent computational complex- ity. This paper presents a novel, tractable abduction procedure for the lightweight description logic EL. The proposed approach extends recent research on automata-based axiom pinpointing (which is in some sense dual to our problem) by assuming information from a predefined ab- ducible part of the domain model if necessary, while the remainder of the domain is considered to be fixed. Our research is motivated by the need for efficient diagnostic reasoning for large-scale industrial systems where observations are partially incomplete and often sparse, but nevertheless the largest part of the domain such as physical structures is known. Tech- nically, we introduce a novel pattern-based definition of abducibles and show how to construct a weighted automaton that commonly encodes the definite and abducible part of the domain model. We prove that its behavior provides a compact representation of all possible hypotheses explaining an observation, and is in fact computable in PTime. Abductive reasoning is a method for generating hypotheses that explain an obser- vation based on a model of the domain, typically in the presence of incomplete data. Its non-monotonicity and explorative nature make abduction a promis- ing candidate for the interpretation of potentially incomplete information - a task which is much harder to accomplish using established monotonic inference methods such as deduction or the more elaborate axiom pinpointing. The appli- cations of abductive inference are diverse, ranging from text interpretation (1) to plan generation and analysis (2), and interpretation of sensor (3) or multimedia data (4). Our research on abductive inference is motivated by industrial applica- tions in Ambient Assisted Living and assistive diagnosis for complex technical devices. In these scenarios we found the underlying models being typically large, though not overly complex in their structure. The main consideration is therefore scalability with respect to the size of the domain model; to effectively support humans or to avoid consequential damage to machinery, information processing is subject to soft realtime constraints. Proc. 23rd Int. Workshop on Description Logics (DL2010), CEUR-WS 573, Waterloo, Canada, 2010.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.685
Threshold uncertainty score0.357

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.043
GPT teacher head0.266
Teacher spread0.223 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it