We present a game-based semantic framework in which the time complexity of any IMELL proof can be read out of its interpretation. This gives a compositional view of the geometry of...
We present an authorization logic that permits reasoning with explicit time. Following a proof-theoretic approach, we study the meta-theory of the logic, including cut elimination...
We present a natural deduction calculus for the computation tree logic CTL defined with the full set of classical and temporal logic operators. The system extends the natural ded...
Alexander Bolotov, Oleg Grigoriev, Vasilyi Shangin
The use of background knowledge and the adoption of Horn clausal logic as a knowledge representation and reasoning framework are the distinguishing features of Inductive Logic Prog...
We Imbed Into a first order logic a representation language that combines atemporal knowledge with time stamps in a hierarchical fashion. Each time structure contains its own chro...