This paper uses a constraint set approach to linear programming problems with equality constraints whose coefficients and/or right-hand side values could be uncertain. We consider ...
We develop kernels for measuring the similarity between relational instances using background knowledge expressed in first-order logic. The method allows us to bridge the gap betw...
Logic programming with stable logic semantics (SLP) is a logical formalism that assigns to sets of clauses in the language admitting negations in the bodies a special kind of mode...
Abstract. The paradigm of argumentation has been used in the literature to assign meaning to knowledge bases in general, and logic programs in particular. With this paradigm, rules...
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...