Local-to-Global Consistency Implies Tractability of Abduction
Authors: Michal Wrona
AAAI 2014 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | Our main contribution is an algorithm that under some natural conditions decides Abduction(Γ, HYP, M) in P when Γ has local-to-global consistency. As we show in the number of examples, our approach offers an opportunity to consider abduction in the context of spatial and temporal reasoning (qualitative calculi such as Allen s interval algebra or RCC-5) and that our procedure solves some related abduction problems in polynomial time. |
| Researcher Affiliation | Academia | Michał Wrona Department of Computer and Information Science, Link oping University SE-581 83 Link oping, Sweden Email: michal.wrona@liu.se |
| Pseudocode | Yes | Algorithm 1: Algorithm Lt G-OEAbd |
| Open Source Code | No | The paper describes an algorithm but does not mention providing open-source code for its implementation. |
| Open Datasets | No | The paper discusses theoretical frameworks and their applicability to qualitative calculi but does not refer to specific datasets used for training or empirical evaluation. |
| Dataset Splits | No | The paper is theoretical and does not report on empirical experiments, thus no dataset split information for validation is provided. |
| Hardware Specification | No | The paper focuses on theoretical aspects and algorithm design, and therefore does not specify any hardware used for experiments. |
| Software Dependencies | No | The paper describes an algorithm and theoretical framework but does not list specific software dependencies with version numbers, as it does not report on an implementation or empirical evaluation. |
| Experiment Setup | No | The paper focuses on theoretical results and algorithm design, and therefore does not include details on experimental setup such as hyperparameters or training configurations. |