Confidence-weighted (CW) learning [6], an online learning method for linear clas-sifiers, maintains a Gaussian distributions over weight vectors, with a covariancematrix that represents uncertainty about weights and correlations. Confidenceconstraints ensure that a weight vector drawn from the hypothesis distributioncorrectly classifies examples with a specified probability. Wit...

Caicedo, X., Compactness and normality in abstract logics, Annals of Pure and Applied Logic 59 (1993) 33-43. We generalize a theorem of Mundici relating compactness of a regular logic L to a strong form of normality of the associated spaces of models. Moreover, it is shown that compactness is in fact equivalent to ordinary normality of the model spaces when L has uniform reduction for infinite ...

We explore how computational ontologies can be impactful vis-à-vis the developing discipline of “data science.” We posit an approach wherein management theories are represented as formal axioms, and then applied to draw inferences about data that reside in corporate databases. That is, management theories would be implemented as rules within a data analytics engine. We demonstrate a case study ...

Monadic MV –algebras are an algebraic model of the predicate calculus of the Lukasiewicz infinite valued logic in which only a single individual variable occurs. GMV -algebras are a non-commutative generalization of MV -algebras and are an algebraic counterpart of the non-commutative Lukasiewicz infinite valued logic. We introduce monadic GMV -algebras and describe their connections to certain ...

This work can be considered a step to simplify the dynamic integrity constraint checking. We propose a method to transform a dynamic constraint to an equivalent past-directed form. This transformation will facilitate the constraint checking in temporal databases. The method proposed deals with integrity constraints defined by first-order logic formulas with explicit time in a denial form. It is...

ion mechanism. Many database researchers have used OSFOL to view the Relational Data Model (RDM) ; however, no RDM has been modelled by MSFOL. This paper first gives a formal definition for MSFOL and then its advantages of expressiveness and of abstraction are illustrated. Two reduction algorithms which can transform an MSFOL-based language into\from an OSFOL-based language are given. The seman...

The paper looks into the expression of intensification with parametric nouns such as PRICE, COST, FEE, RATE, etc., focusing on collocations these nouns form with intensifying adjectives, inchoative and causative intensifying verbs and corresponding de-verbal nouns. Degrees of intensification possible with these nouns are discussed, as well as analytical vs. synthetic expression of intensificati...

We consider bivariate polynomials orthogonal on the bicircle with respect to a positive linear functional. The lexicographical and reverse lexicographical orderings are used to order the monomials. Recurrence formulas are derived between the polynomials of different degrees. These formulas link the orthogonal polynomials constructed using the lexicographical ordering with those constructed usin...

We compare the definability of total functionals over the reals in two functional-programming approaches to exact real-number computation: the extensional approach, in which one has an abstract datatype of real numbers; and the intensional approach, in which one encodes real numbers using ordinary datatypes. We show that the type hierarchies coincide up to second-order types, and we relate this...

Logical equivalence between logic programs that are firstorder logic formulas holds between few logic programs, partly because first-order logic does not allow auxiliary programs and data structures to be hidden. As a result of not having such abstractions, logical equivalence will force these auxiliaries to be present in any equivalence program. Higher-order quantification can be use to hide p...