We explore the possibility of a logic where a conclusion substantially improves over its premise(s): Specifically, we intend to rule out inference steps such that the premise conv...
Query graphs with cuts are inspired by Sowa’s conceptual graphs, which are in turn based on Peirce’s existential graphs. In my thesis ‘The Logic System of Concept Graphs with...
When comparing inductive logic programming (ILP) and attribute-value learning techniques, there is a trade-off between expressive power and efficiency. Inductive logic programming ...
Hendrik Blockeel, Luc De Raedt, Nico Jacobs, Bart ...
We present a way to add user's background knowledge to formal concept analysis. The type of background knowledge we deal with relates to relative importance of attributes in ...
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...