Focused Inference and System P

Authors: Marco Wilhelm, Gabriele Kern-Isberner6522-6529

AAAI 2021 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical In this paper, we define a series of query-dependent, syntactically-driven focused inference relations, elaborate on their formal properties, and show that the series converges against System P. We take advantage of this result in form of an anytime algorithm for drawing inferences which is accompanied by a thorough complexity analysis.
Researcher Affiliation Academia Marco Wilhelm and Gabriele Kern-Isberner Department of Computer Science, TU Dortmund, Dortmund, Germany marco.wilhelm@tu-dortmund.de, gabriele.kern-isberner@cs.tu-dortmund.de
Pseudocode Yes Algorithm 1: Consistency test for a knowledge base... Algorithm 2: Consistency test for a knowledge base... Algorithm 3: Iterative query answering in System P.
Open Source Code No The paper does not provide any statement or link indicating the availability of open-source code for the methodology described.
Open Datasets No The paper is theoretical and does not use or reference any empirical datasets for training or evaluation. Therefore, it does not provide access information for a public dataset.
Dataset Splits No The paper is theoretical and does not involve empirical experiments with data. It does not mention any training, validation, or test dataset splits.
Hardware Specification No The paper is theoretical and focuses on algorithms and formal properties. There is no mention of specific hardware used for any computations.
Software Dependencies No The paper is theoretical and describes algorithms. It does not specify any software dependencies with version numbers needed for replication.
Experiment Setup No The paper is theoretical and defines formal properties and algorithms. It does not describe an experimental setup, hyperparameters, or training configurations.