Notice: The reproducibility variables underlying each score are classified using an automated LLM-based pipeline, validated against a manually labeled dataset. LLM-based classification introduces uncertainty and potential bias; scores should be interpreted as estimates. Full accuracy metrics and methodology are described in [1].
Knowledge Representation in Probabilistic Spatio-Temporal Knowledge Bases
Authors: Francesco Parisi, John Grant
JAIR 2016 | Venue PDF | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We represent knowledge as integrity constraints in a formalization of probabilistic spatiotemporal knowledge bases. We start by defining the syntax and semantics of a formalization called PST knowledge bases. This definition generalizes an earlier version, called SPOT, which is a declarative framework for the representation and processing of probabilistic spatio-temporal data where probability is represented as an interval because the exact value is unknown. We augment the previous definition by adding a type of non-atomic formula that expresses integrity constraints. The result is a highly expressive formalism for knowledge representation dealing with probabilistic spatio-temporal data. We obtain complexity results both for checking the consistency of PST knowledge bases and for answering queries in PST knowledge bases, and also specify tractable cases. All the domains in the PST framework are finite, but we extend our results also to arbitrarily large finite domains. |
| Researcher Affiliation | Academia | Francesco Parisi EMAIL Department of Informatics, Modeling, Electronics and System Engineering University of Calabria, Rende, Italy John Grant EMAIL Department of Computer Science and UMIACS University of Maryland, College Park, USA |
| Pseudocode | No | The paper provides formal definitions, theorems, proofs, and examples, but does not contain any explicitly labeled pseudocode or algorithm blocks describing a computational procedure. |
| Open Source Code | No | The paper does not mention any open-source code for the methodology described. It discusses related work and theoretical aspects without providing implementation details or links to code repositories. |
| Open Datasets | No | The paper describes conceptual frameworks and theoretical results. While it mentions applications (e.g., 'airport security system') and previous work on 'US Navy databases' in the Related Work section, it does not use any specific dataset for its own experiments or provide access information for any dataset it might have generated or used for illustration. |
| Dataset Splits | No | The paper describes a theoretical framework, its syntax, semantics, and complexity results. It does not involve empirical experiments requiring dataset splits. |
| Hardware Specification | No | The paper focuses on theoretical concepts, complexity analysis, and formal definitions of knowledge representation. It does not describe any experimental setup or mention specific hardware used for computations. |
| Software Dependencies | No | The paper presents theoretical work on knowledge representation and probabilistic spatio-temporal knowledge bases. It does not describe any specific software implementation or list software dependencies with version numbers. |
| Experiment Setup | No | The paper is theoretical in nature, presenting formal definitions, theorems, and complexity analysis. It does not include any experimental results, and therefore no experimental setup details, hyperparameters, or training configurations are provided. |