Formulas of Hoare logic are asserted programs where is a program and , are assertions. The language of programs varies; in the survey [Apt 1980], one finds the language of wh...
We study the automation of the verification of Unity programs with infinite or parameterized state space. This paper presents methods allowing the transformation of some second-ord...
Translations to (first-order) datalog have been used in a number of inferencing techniques for description logics (DLs), yet the relationship between the semantic expressivities o...
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, ...
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...