In this paper, we propose a translation from normal first-order logic programs under the answer set semantics to first-order theories on finite structures. Specifically, we introd...
Two recently developed methods for extraction of crisp logical rules from neural networks trained with backpropagation algorithm are compared. Both methods impose constraints on th...
Wlodzislaw Duch, Rafal Adamczak, Krzysztof Grabcze...
A new version of transition logic is presented. It integrates (dynamic) transitions, which change world states, and classical (static) reasoning, restricted in the paper to Horn l...
In this paper we show that an arbitrary propositional theory, when interpreted under the answer sets semantics (called Equilibrium Logic for this general syntax), can always be re...
In this paper we introduce Fresh Logic, a natural deduction style first-order logic extended with term-formers and quantifiers derived from the model of names and binding in abst...