Robert Veroff

University of New Mexico, Albuquerque, NM, United States

Are you Robert Veroff?

Claim your profile

Publications (40)20.23 Total impact

  • Source
    [show abstract] [hide abstract]
    ABSTRACT: We consider the class of pointed varieties of algebras having a lattice term reduct and we show that each such variety gives rise in a natural way, and according to a regular pattern, to at least three interesting logics. Although the mentioned class includes several logically and algebraically significant examples (e.g. Boolean algebras, MV algebras, Boolean algebras with operators, residuated lattices and their subvarieties, algebras from quantum logic or from depth relevant logic), we consider here in greater detail Abelian ℓ-groups, where such logics respectively correspond to: i) Meyer and Slaney’s Abelian logic [31]; ii) Galli et al.’s logic of equilibrium [21]; iii) a new logic of “preservation of truth degrees”.
    Logica Universalis 09/2008; 2(2):209-233.
  • M. Spinks, R. Veroff
    [show abstract] [hide abstract]
    ABSTRACT: The goal of this two-part series of papers is to show that constructive logic with strong negation N is definitionally equivalent to a certain axiomatic extension NFL ew of the substructural logic FL ew . The main result of Part I of this series [41] shows that the equivalent variety semantics of N (namely, the variety of Nelson algebras) and the equivalent variety semantics of NFL ew (namely, a certain variety of FL ew -algebras) are term equivalent. In this paper, the term equivalence result of Part I [41] is lifted to the setting of deductive systems to establish the definitional equivalence of the logics N and NFL ew . It follows from the definitional equivalence of these systems that constructive logic with strong negation is a substructural logic.
    Studia Logica 01/2008; 89(3):401-425. · 0.34 Impact Factor
  • [show abstract] [hide abstract]
    ABSTRACT: Ideally biosignatures can be detected at the early infection phase and used both for developing diagnostic patterns and for prognostic triage. Such biosignatures are important for vaccine validation and to provide risk stratification to a population such as for the identification of individuals who are exposed to biological or chemical agents and who are at high risk for developing an infection. The research goal is to detect broad based biosignature models and is initially focused on developing effective computer-augmented pathology tied to animal models developed at the University of New Mexico (UNM). Using lung tissue from infected and nai ve mice, feature extraction from images of the tissue under a specialized microscope, and Bayesian networks to analyze the data sets of features, we were able to differentiate normal from diseased samples and viral from bacterial samples in mid to late stages of infection. This effort has shown the potential effectiveness of computer-augmented pathology in this application. The extended research intends to couple analysis of serum, microarray analysis of organs, proteomic data and the pathology. The rational for the current invasive procedure on animal models is to facilitate the development of data analysis and machine learning techniques that can eventually be generalized to the task of discovering non-invasive and early stage biosignatures for human models.
    Computers in Biology and Medicine 12/2007; 37(11):1539-52. · 1.16 Impact Factor
  • Source
    Leukemia 07/2007; 21(6):1341-4. · 10.16 Impact Factor
  • Source
    M. Spinks, R. Veroff
    [show abstract] [hide abstract]
    ABSTRACT: Nelson algebras arise naturally in algebraic logic as the algebraic models of Nelson's constructive logic with strong negation. This note gives two characterisations of the variety of Nelson algebras up to term equivalence, together with a characterisation of the finite Nelson algebras up to polynomial equivalence. The results answer a question of Blok and Pigozzi and clarify some earlier work of Brignole and Monteiro.
    Revista de la Unión Matemática Argentina, ISSN 0041-6932, Vol. 48, Nº. 1, 2007, pags. 27-39. 01/2007;
  • L. Wos, R. Veroff, B. Smith, W. McCune
    04/2006: pages 316-332;
  • Source
    R. Veroff, M. Spinks
    [show abstract] [hide abstract]
    ABSTRACT: The skew Boolean propositional calculus (SBPC{SBPC}) is a generalization of the classical propositional calculus that arises naturally in the study of certain well-known deductive systems. In this article, we consider a candidate presentation of SBPC{SBPC} and prove it constitutes a Hilbert-style axiomatization. The problem reduces to establishing that the logic presented by the candidate axiomatization is algebraizable in the sense of Blok and Pigozzi. In turn, this process is equivalent to verifying four particular formulas are derivable from the candidate presentation. Automated deduction methods played a central role in proving these four theorems. In particular, our approach relied heavily on the method of proof sketches.
    Journal of Automated Reasoning 01/2006; 37(1):3-20. · 0.57 Impact Factor
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: A conjecture of Padmanabhan, on provability in cancellative semigroups, is addressed. Several of Levi’s group theory commutator theorems are proved for cancellative semigroups. The proofs, found by automated deduction, support the conjecture.
    Agronomy Journal 08/2005; 71(1):152-157. · 0.46 Impact Factor
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: We present short single axioms for ortholattices, orthomodular lattices, and modular ortholattices, all in terms of the Sheffer stroke. The ortholattice axiom is the shortest possible. We also give multiequation bases in terms of the Sheffer stroke and in terms of join, meet, and complementation. Proofs are omitted but are available in an associated technical report and on the Web. We used computers extensively to find candidates, reject candidates, and search for proofs that candidates are single axioms.
    Algebra Universalis 01/2005; 52(4):541-549. · 0.45 Impact Factor
  • [show abstract] [hide abstract]
    ABSTRACT: No abstract prepared.
    Proposed for publication in New England Journal of Medicine. 06/2004;
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: We present new techniques for the application of a Bayesian network learning framework to the problem of classifying gene expression data. The focus on classification permits us to develop techniques that address in several ways the complexities of learning Bayesian nets. Our classification model reduces the Bayesian network learning problem to the problem of learning multiple subnetworks, each consisting of a class label node and its set of parent genes. We argue that this classification model is more appropriate for the gene expression domain than are other structurally similar Bayesian network classification models, such as Naive Bayes and Tree Augmented Naive Bayes (TAN), because our model is consistent with prior domain experience suggesting that a relatively small number of genes, taken in different combinations, is required to predict most clinical classes of interest. Within this framework, we consider two different approaches to identifying parent sets which are supported by the gene expression observations and any other currently available evidence. One approach employs a simple greedy algorithm to search the universe of all genes; the second approach develops and applies a gene selection algorithm whose results are incorporated as a prior to enable an exhaustive search for parent sets over a restricted universe of genes. Two other significant contributions are the construction of classifiers from multiple, competing Bayesian network hypotheses and algorithmic methods for normalizing and binning gene expression data in the absence of prior expert knowledge. Our classifiers are developed under a cross validation regimen and then validated on corresponding out-of-sample test sets. The classifiers attain a classification rate in excess of 90% on out-of-sample test sets for two publicly available datasets. We present an extensive compilation of results reported in the literature for other classification methods run against these same two datasets. Our results are comparable to, or better than, any we have found reported for these two sets, when a train-test protocol as stringent as ours is followed.
    Journal of Computational Biology 02/2004; 11(4):581-615. · 1.56 Impact Factor
  • Source
    R. VEROFF, M. SPINKS
    [show abstract] [hide abstract]
    ABSTRACT: We present a syntactic proof that equation
    01/2004;
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: In this note we show that the equational theory of all lattices is defined by a single absorption law. The identity of length 29 with 8 variables is shorter than previously known such equations defining lattices.
    Algebra Universalis 08/2003; · 0.45 Impact Factor
  • Source
    Michael Beeson, Robert Veroff, Larry Wos
    [show abstract] [hide abstract]
    ABSTRACT: This article answers two questions (posed in the literature), each concerning the guaranteed existence of proofs free of double negation. A proof is free of double negation if none of its deduced steps contains a term of the form n(n(t)) for some term t, where n denotes negation. The first question asks for conditions on the hypotheses that, if satisfied, guarantee the existence of a double-negation-free proof when the conclusion is free of double negation. The second question asks about the existence of an axiom system for classical propositional calculus whose use, for theorems with a conclusion free of double negation, guarantees the existence of a double-negation-free proof. After giving conditions that answer the first question, we answer the second question by focusing on the Lukasiewicz three-axiom system. We then extend our studies to infinite-valued sentential calculus and to intuitionistic logic and generalize the notion of being double-negation free. The double-negation proofs of interest rely exclusively on the inference rule condensed detachment, a rule that combines modus ponens with an appropriately general rule of substitution. The automated reasoning program OTTER played an indispensable role in this study.
    Studia Logica 02/2003; · 0.34 Impact Factor
  • Source
    Robert Veroff
    [show abstract] [hide abstract]
    ABSTRACT: Abstract In this article, we present a short 2 - basis for Boolean algebra in terms of the Sheffer stroke and prove that no such 2 - basis can be shorter We also prove that the new 2 - basis is unique (for its length) up to applications of commutativity Our proof of the 2 - basis was found by using the method of proof sketches and relied on the use of an automated reasoning program
    Journal of Automated Reasoning 01/2003; 31(1):1-9. · 0.57 Impact Factor
  • Source
    Robert Veroff
    [show abstract] [hide abstract]
    ABSTRACT: In this note, we present a first-order proof that equation (((x y) y) x) x = (((y x) x) y) y holds in the quasivariety HBCK.
    11/2002;
  • Paul Helman, Robert Veroff, Susan R Atlas
    [show abstract] [hide abstract]
    ABSTRACT: We present new techniques for the application of the Bayesian network learning framework to the problem of classifying gene expression data. Our techniques address the complexities of learning Bayesian nets in several ways. First, we focus on classification and demonstrate how this reduces the Bayesian net learning problem to the problem of learning subnetworks consisting of a class label node and its set of parent genes. We then consider two different approaches to identifying parent sets which are supported by current evidence; one approach employs a simple greedy algorithm to search the universe of all genes, and a second approach develops and applies a gene selection algorithm whose results are incorporated as a prior to enable an exhaustive search for parent sets over a restricted universe of genes. Two other significant contributions are the construction of classifiers from multiple, competing Bayesian network hypotheses and algorithmic methods for normalizing and binning gene expression data in the absence of prior expert knowledge. Our classifiers are first developed under a cross validation regimen against two publicly available data sets and then validated on corresponding out-of-sample test sets. The classifiers attain a classification rate in excess of 90% on each of these out-of-sample test sets.
    06/2002;
  • Source
    Larry Wos, Robert Veroff, Gail W. Pieper
    [show abstract] [hide abstract]
    ABSTRACT: Contents 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2 The clause language paradigm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.1 Components of the clause language paradigm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2 Interplay of the components . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3 A fragment of the history of automated reasoning 1960--2002 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4 Answering open questions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 4.1 Robbins algebra . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
    06/2002;
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: We present short single equational axioms for Boolean algebra in terms of disjunction and negation and in terms of the Sheffer stroke. Previously known single axioms for these theories are much longer than the ones we present. We show that there is no shorter axiom in terms of the Sheffer stroke than the ones we present. Automated deduction techniques were used for several different aspects of the work. Keywords: Boolean algebra, Sheffer stroke, single axiom 1. Background and
    Journal of Automated Reasoning 10/2001; · 0.57 Impact Factor
  • Robert Veroff
    [show abstract] [hide abstract]
    ABSTRACT: In this article, we describe a procedure for systematically searching for shortest proofs in logical systems based on the inference rule condensed detachment. The procedure relies on applications of linked UR-resolution and uses demodulation to categorize derivations. Although the procedure is exhaustive in nature – and therefore realistically is applicable only to relatively small problems – it is shown to overcome the obstacles to finding shortest proofs presented by ordinary resolution-style theorem proving.
    Journal of Automated Reasoning 01/2001; 27:123-139. · 0.57 Impact Factor