Verification of Knowledge-Based Programs over Description Logic Actions
Authors: Benjamin Zarrieß, Jens Claßen
IJCAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | After proving undecidability for the general case, we then discuss a restricted fragment where verification becomes decidable. The provided proof is constructive and comes with an upper bound on the procedure s complexity. |
| Researcher Affiliation | Academia | Benjamin Zarrieß Theoretical Computer Science TU Dresden, Germany zarriess@tcs.inf.tu-dresden.de Jens Claßen Knowledge-Based Systems Group RWTH Aachen University, Germany classen@kbsg.rwth-aachen.de |
| Pseudocode | No | The paper defines the syntax and semantics of a programming language but does not provide structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide information about open-source code for the described methodology. |
| Open Datasets | No | The paper is theoretical and does not use or reference any datasets for training. |
| Dataset Splits | No | The paper is theoretical and does not describe dataset splits for validation or training. |
| Hardware Specification | No | The paper is theoretical and does not describe hardware specifications for experiments. |
| Software Dependencies | No | The paper is theoretical and does not list specific software dependencies with version numbers. |
| Experiment Setup | No | The paper is theoretical and does not describe an experimental setup with hyperparameters or training configurations. |