Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Tractable interval temporal propositional and description logics
Tractable Interval Temporal Propositional and Description Logics Page 1 Tractable Interval
Temporal Propositional and Description Logics A. Artale1 and R. Kontchakov2 and V …
Temporal Propositional and Description Logics A. Artale1 and R. Kontchakov2 and V …
Horn fragments of the Halpern-Shoham interval temporal logic
We investigate the satisfiability problem for Horn fragments of the Halpern-Shoham interval
temporal logic depending on the type (box or diamond) of the interval modal operators, the …
temporal logic depending on the type (box or diamond) of the interval modal operators, the …
[HTML][HTML] On coarser interval temporal logics
The primary characteristic of interval temporal logic is that intervals, rather than points, are
taken as the primitive ontological entities. Given their generally bad computational behavior …
taken as the primitive ontological entities. Given their generally bad computational behavior …
Towards a general method for logical rule extraction from time series
Extracting rules from temporal series is a well-established temporal data mining technique.
The current literature contains a number of different algorithms and experiments that allow …
The current literature contains a number of different algorithms and experiments that allow …
[HTML][HTML] Computational complexity of hybrid interval temporal logics
PA Wałęga - Annals of Pure and Applied Logic, 2023 - Elsevier
Interval logics are very expressive temporal formalisms, but reasoning with them is often
undecidable or has high computational complexity. As a result, a vast number of approaches …
undecidable or has high computational complexity. As a result, a vast number of approaches …
On the complexity of fragments of Horn modal logics
Modal logic is a paradigm for several useful and applicable formal systems in computer
science, and, in particular, for temporal logics of various kinds. It generally retains the low …
science, and, in particular, for temporal logics of various kinds. It generally retains the low …
On the expressive power of sub-propositional fragments of modal logic
Modal logic is a paradigm for several useful and applicable formal systems in computer
science. It generally retains the low complexity of classical propositional logic, but notable …
science. It generally retains the low complexity of classical propositional logic, but notable …
Computational complexity of a hybridized Horn fragment of Halpern-Shoham logic
PA Wałęga - Indian Conference on Logic and Its Applications, 2016 - Springer
We propose hybridization of sub-propositional fragments of Halpern-Shoham logic as a way
of obtaining expressive and decidable referential interval temporal logics. In the paper, we …
of obtaining expressive and decidable referential interval temporal logics. In the paper, we …
On sub-propositional fragments of modal logic
In this paper, we consider the well-known modal logics K, T, K4, and S4, and we study some
of their sub-propositional fragments, namely the classical Horn fragment, the Krom fragment …
of their sub-propositional fragments, namely the classical Horn fragment, the Krom fragment …
On coarser interval temporal logics and their satisfiability problem
The primary characteristic of interval temporal logic is that intervals, rather than points, are
taken as the primitive ontological entities. Their computational behaviour is generally bad …
taken as the primitive ontological entities. Their computational behaviour is generally bad …