Rapid construction of algebraic axioms from samples

J. M. Barzdin; G. J. Barzdin

doi:10.1016/0304-3975(91)90307-N

Rapid construction of algebraic axioms from samples

J. M. Barzdin^*
, G. J. Barzdin

^*Šī darba korespondējošais autors

University of Latvia

Zinātniskās darbības rezultāts: Devums žurnālam › Zinātniskais raksts (žurnālā) › koleģiāli recenzēts

10 Atsauces (Scopus)

Kopsavilkums

An axiom is called reliable if it is confirmed in several places in a given sample of algebra. A very effective algorithm for enumerating such axioms is described.

Oriģinālvaloda	Angļu
Lapas (no-līdz)	199-208
Lapu skaits	10
Žurnāls	Theoretical Computer Science
Sējums	90
Izdevuma numurs	1
DOIs	https://doi.org/10.1016/0304-3975(91)90307-N
Publikācijas statuss	Publicēts - 11 nov. 1991
Ārēji publicēts	Jā

Piekļuve Dokumentiem

10.1016/0304-3975(91)90307-N

Citi faili un saites

Saite uz publikāciju Scopus

Citēt šo

@article{e898e67e3e31488f8711a389d2456426,

title = "Rapid construction of algebraic axioms from samples",

abstract = "An axiom is called reliable if it is confirmed in several places in a given sample of algebra. A very effective algorithm for enumerating such axioms is described.",

author = "Barzdin, \{J. M.\} and Barzdin, \{G. J.\}",

year = "1991",

month = nov,

day = "11",

doi = "10.1016/0304-3975(91)90307-N",

language = "English",

volume = "90",

pages = "199--208",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - Rapid construction of algebraic axioms from samples

AU - Barzdin, J. M.

AU - Barzdin, G. J.

PY - 1991/11/11

Y1 - 1991/11/11

N2 - An axiom is called reliable if it is confirmed in several places in a given sample of algebra. A very effective algorithm for enumerating such axioms is described.

AB - An axiom is called reliable if it is confirmed in several places in a given sample of algebra. A very effective algorithm for enumerating such axioms is described.

UR - https://www.scopus.com/pages/publications/0026255194

U2 - 10.1016/0304-3975(91)90307-N

DO - 10.1016/0304-3975(91)90307-N

M3 - Article

AN - SCOPUS:0026255194

SN - 0304-3975

VL - 90

SP - 199

EP - 208

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1

ER -