UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

A Wos Challenge Met

Journal of automated reasoning, 2022-11, Vol.66 (4), p.565-574

Veroff, Robert

2022

Volltextzugriff (PDF)

Constructive Logic with Strong Negation Is a Substructural Logic. I

Studia logica, 2008-04, Vol.88 (3), p.325-348

2008

Volltextzugriff (PDF)

Loops with Abelian Inner Mapping Groups: An Application of Automated Deduction

Automated Reasoning and Mathematics, p.151-164

Volltextzugriff (PDF)

A Geometric Procedure with Prover9

Automated Reasoning and Mathematics, p.139-150

Volltextzugriff (PDF)

Formalizing a Fragment of Combinatorics on Words

Unveiling Dynamics and Complexity, p.24-31

Volltextzugriff (PDF)

Automated Reasoning and Mathematics: Essays in Memory of William W. McCune

1, 2013

Volltextzugriff (PDF)

Constructive Logic with Strong Negation Is a Substructural Logic. II

Studia logica, 2008-08, Vol.89 (3), p.401-425

2008

Volltextzugriff (PDF)

Discriminator logics (Research announcement)

The Australasian journal of logic, 2014-11, Vol.11 (2)

2014

Volltextzugriff (PDF)

A Bayesian network classification methodology for gene expression data

Journal of computational biology, 2004, Vol.11 (4), p.581-615

2004

Volltextzugriff (PDF)

Solving Open Questions and Other Challenge Problems Using Proof Sketches

Journal of automated reasoning, 2001-08, Vol.27 (2), p.157

Veroff, Robert

2001

Volltextzugriff (PDF)

A Shortest 2-Basis for Boolean Algebra in Terms of the Sheffer Stroke

Journal of automated reasoning, 2003-09, Vol.31 (1), p.1-9

Veroff, Robert

2003

Volltextzugriff (PDF)

Abelian Logic and the Logics of Pointed Lattice-Ordered Varieties

Logica universalis, 2008-10, Vol.2 (2), p.209-233

2008

Volltextzugriff (PDF)

Finding Shortest Proofs: An Application of Linked Inference Rules

Journal of automated reasoning, 2001-08, Vol.27 (2), p.123

Veroff, Robert

2001

Volltextzugriff (PDF)

Using hints to increase the effectiveness of an automated reasoning program: Case studies

Journal of automated reasoning, 1996-06, Vol.16 (3), p.223-239

Veroff, Robert

1996

Volltextzugriff (PDF)

Short Single Axioms for Boolean Algebra

Journal of automated reasoning, 2002-03, Vol.29 (1), p.1-16

2002

Volltextzugriff (PDF)

Double-Negation Elimination in Some Propositional Logics

Studia logica, 2005-08, Vol.80 (2/3), p.195-234

2005

Volltextzugriff (PDF)

Learning and modeling biosignatures from tissue images

Computers in biology and medicine, 2007-11, Vol.37 (11), p.1539-1552

2007

Volltextzugriff (PDF)

The application of automated reasoning to formal models of combinatorial optimization

Applied mathematics and computation, 2001-05, Vol.120 (1), p.175-194

2001

Volltextzugriff (PDF)

Paraconsistent constructive logic with strong negation as a contraction-free relevant logic

Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science, 2018, Vol.16, p.323-379

2018

Volltextzugriff (PDF)

A Gene Expression Classifier for Improved Risk Classification and Outcome Prediction in Pediatric Acute Lymphoblastic Leukemia (ALL)

Blood, 2005-11, Vol.106 (11), p.762-762

2005

Volltextzugriff (PDF)

Yet another single law for lattices

Algebra universalis, 2003-01, Vol.50 (2), p.165-169

2003

Volltextzugriff (PDF)

Understanding integrated circuits

IEEE design & test of computers, 1999-04, Vol.16 (2), p.26-37

1999

Volltextzugriff (PDF)

The linked inference principle, I: The formal treatment

Journal of automated reasoning, 1992-04, Vol.8 (2)

1992

Volltextzugriff (PDF)

Designing deductive databases

Journal of automated reasoning, 1988-03, Vol.4 (1)

1988

Volltextzugriff (PDF)

AUTOMATIC TRANSFORMATIONS IN THE INFERENCE PROCESS

VEROFF, ROBERT LOUIS

1980

Volltextzugriff (PDF)

1 – 25 von 46

Menü

Weitere Dienste

Einstellungen

A Wos Challenge Met

Constructive Logic with Strong Negation Is a Substructural Logic. I

Loops with Abelian Inner Mapping Groups: An Application of Automated Deduction

A Geometric Procedure with Prover9

Formalizing a Fragment of Combinatorics on Words

Automated Reasoning and Mathematics: Essays in Memory of William W. McCune

Constructive Logic with Strong Negation Is a Substructural Logic. II

Discriminator logics (Research announcement)

A Bayesian network classification methodology for gene expression data

Solving Open Questions and Other Challenge Problems Using Proof Sketches

A Shortest 2-Basis for Boolean Algebra in Terms of the Sheffer Stroke

Abelian Logic and the Logics of Pointed Lattice-Ordered Varieties

Finding Shortest Proofs: An Application of Linked Inference Rules

Using hints to increase the effectiveness of an automated reasoning program: Case studies

Short Single Axioms for Boolean Algebra

Double-Negation Elimination in Some Propositional Logics

Learning and modeling biosignatures from tissue images

The application of automated reasoning to formal models of combinatorial optimization

Paraconsistent constructive logic with strong negation as a contraction-free relevant logic

A Gene Expression Classifier for Improved Risk Classification and Outcome Prediction in Pediatric Acute Lymphoblastic Leukemia (ALL)

Yet another single law for lattices

Understanding integrated circuits

The linked inference principle, I: The formal treatment

Designing deductive databases

AUTOMATIC TRANSFORMATIONS IN THE INFERENCE PROCESS

Suchergebnisse filtern