This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
In the line of previous work by S. Muggleton and C. Sakama, we extend the logical characterization of inductive logic programming, to normal logic programs under the stable models ...
Abstract. We define a translation of aggregate programs to normal logic programs which preserves the set of partial stable models. We then define the classes of definite and str...
We consider a variant of Gold’s learning paradigm where a learner receives as input n different languages (in form of one text where all input languages are interleaved). Our g...