In this paper, we make an attempt to use Inductive Logic Programming (ILP) to automatically learn non trivial descriptions of symbols, based on a formal description. This work is ...
In previous work, we proposed an algebra whose operators allow to specify the valid compound terms of a faceted taxonomy, in a flexible manner (by combining positive and negative ...
Anastasia Analyti, Yannis Tzitzikas, Nicolas Spyra...
Graphical languages provide a powerful tool for describing the behaviour of quantum systems. While the use of graphs vastly reduces the complexity of many calculations [4,10], manu...
Abstract. This paper presents a decidable fragment for combining ontologies and rules in order-sorted logic programming. We describe ordersorted logic programming with sort, predic...
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...
Atish Das Sarma, Richard J. Lipton, Danupon Nanong...