In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
Many applications would benefit if media objects such as images could be selected and classified (or clustered) such that "conceptually similar" images are grouped toget...
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...