Executable Temporal Logic for Non-monotonic Reasoning
β Scribed by JOERI ENGELFRIET; JAN TREUR
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 454 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper we view non-monotonic reasoning as a (special kind of) process. As temporal logic is a common formalism to specify and derive properties of processes, we introduce a variant of temporal logic as a general specification language for reasoning processes. We show that it is possible to execute finite specifications in this language, which leads to executability of a large class of finite non-monotonic reasoning processes.
π SIMILAR VOLUMES
We explore the major issues involved in the automatic exploitation of parallelism from the execution models of logic-based non-monotonic reasoning systems. We describe orthogonal techniques to parallelize the computation of models of non-monotonic logic theories, and demonstrate the effectiveness of
Impressive work has been done in the last years concerning the meaning of negation and disjunction in logic programs, but most of this research concentrated on propositional programs only. While it suces to consider the propositional case for investigating general properties and the overall behavior
The analysis and modeling of dynamic processes require the consideration of both spatial and temporal attributes of data and their integration into a GIS database. However, current GIS raster databases have severe limitations related to the temporal component of data. Data are generally stored throu