Polyadic coalgebraic modal logic is studied in the setting of locally presentable categories. It is shown that under certain assumptions, accessible functors admit expressive logi...
We present an extension of first-order predicate logic with a novel predicate ‘at t’ meaning intuitively “this term is a variable symbol”. We give simple sequent proof-ru...
Synthesis of logic programs is considered as a special instance of logic programming. We describe experience made within a logical metaprogramming environment whose central compone...
Over the years, Logic Programming has proved to be a good and natural tool for expressing, querying and manipulating explicit knowledge in many areas of computer science. However, ...
The aim of this paper is to extend the modal logic of knowledge due to Moss and Parikh by state transformers arising, eg, from actions of agents. The peculiarity of Moss and Parik...