Results 271 to 280 of about 517,569 (314)
Some of the next articles are maybe not open access.
Linear Orders on General Algebras
Order, 2005A characterization of partially ordered algebraic structures \((A,F,r)\) having a compatible linear extension of \(r\) is given. As a consequence, it is proved that a partial order \(r\) can be linearly extended if and only if it can be extended on every finitely generated subalgebra. A few further results are obtained.
Radeleczki, Sándor, Szigeti, Jenő
openaire +1 more source
2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541), 2005
Second-order generalization is usually of a more abstract nature than standard generalization, as unseen stimuli may be classified by some higher order rule. The research presents a new theory, which utilises information inheritance in order to perform second-order generalization.
openaire +1 more source
Second-order generalization is usually of a more abstract nature than standard generalization, as unseen stimuli may be classified by some higher order rule. The research presents a new theory, which utilises information inheritance in order to perform second-order generalization.
openaire +1 more source
1998
Generalization is a fundamental operation of inductive inference. While first order syntactic generalization (anti-unification) is well understood, its various extensions are needed in applications. This paper discusses syntactic higher order generalization in a higher order language λ2[1]. Based on the application ordering, we proved the least general
Jianguo Lu +2 more
openaire +1 more source
Generalization is a fundamental operation of inductive inference. While first order syntactic generalization (anti-unification) is well understood, its various extensions are needed in applications. This paper discusses syntactic higher order generalization in a higher order language λ2[1]. Based on the application ordering, we proved the least general
Jianguo Lu +2 more
openaire +1 more source
Generalization of the order separability
Moscow University Mathematics Bulletin, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Generating polynomial orderings
Information Processing Letters, 1994More and more, term rewriting systems (TRSs) are applied in computer science as well as in mathematics. They are based on directed equations which may be used as non-deterministic functional programs. Termination is a key property for computing with TRSs. There are various methods of proving termination of TRSs.
openaire +2 more sources
On cyclotomic generator of order r
Information Processing Letters, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ding, Cunsheng, Helleseth, T.
openaire +2 more sources
Generalized Priestley Quasi-Orders
Order, 2010The authors investigate bounded distributive meet-semilattices, and especially bounded implicative meet-semilattices. First, they develop a new `Priestley-like' duality for the category of bounded distributive meet-semilattices with homomorphisms.
Guram Bezhanishvili, Ramon Jansana
openaire +1 more source
Goal Generation with Ordered Beliefs
2007A rational agent adopts (or changes) its desires/goals when new information becomes available or its "desires" (e.g., tasks it is supposed to carry out) change. In conventional approaches on goal generation a desire is adopted if and only if allconditions leading to its generation are satisfied.
Célia da Costa Pereira +1 more
openaire +1 more source
General Nanomolding of Ordered Phases
Physical Review Letters, 2020Large-scale, controlled fabrication of ordered phases is challenging at the nanoscale, yet highly demanded as their well-ordered structure and chemistry is the key for advanced functionality. Here, we demonstrate a general nanomolding process of ordered phases based on atomic diffusion.
Naijia, Liu +9 more
openaire +2 more sources