This paper analyzes how the semantics of association relationships in OO conceptual modeling can help to build Navigational Models for Web Applications. The work has been develope...
Manoli Albert, Vicente Pelechano, Joan Fons, Gonza...
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
We discuss a Probably Approximate Correct (PAC) learning paradigm for Boolean formulas, which we call PAC meditation, where the class of formulas to be learnt is not known in advan...
Bruno Apolloni, Andrea Brega, Dario Malchiodi, Gio...
Because botanical taxonomies are prototypical classifications it would seem that it should be easy to formalize them as concept lattices or type hierarchies. On closer inspection,...
Abstract. Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-f...