Many events in news articles don't include time arguments. This paper describes two methods, one based on rules and the other based on statistical learning, to predict the un...
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is the k...
We propose to use high-level Petri nets as a model for the semantics of high-level parallel systems. This model is known to be useful for the purpose of verification and we show t...
We present a proof searching technique for the natural deduction calculus for the propositional linear-time temporal logic and prove its correctness. This opens the prospect to ap...
Alexander Bolotov, Oleg Grigoriev, Vasilyi Shangin
We present an algorithm that determines the prime factors of connected graphs with respect to the Cartesian product in linear time and space. This improves a result of Aurenhammee...