A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Relational databases (RDB) are widely used as a backend for information systems, and contain interesting structured data (schema and data). ... The main objective of this work is to build richer ontologies with deep taxonomies from RDB. ... ETTKIRITA Youness, manager of the Stock Management System at the University of Cadi Ayyad-Marrakech, for providing a part of the database of their system to validate our proposal. ...doi:10.14569/ijacsa.2019.0101037 fatcat:fvfrgspj2ndhbn7z73gwrumury
It ensures for two sequences of relations the existence of a constructivization v such that all the relations of the first se- quence are v-recursive but no relation of the second sequence is v-recursively ... Math. 140 (1992), no. 2, 137-155; MR 93h:03048], we asked when a recursive structure .% and a sentence g, with a new relation symbol, have the following property: for each F = there is a relation S such ...
It makes use of the powerful machinery that Shelah invented for classifying the models of a first-order theory: regular type, dimension, dimensional order property (DOP), depth, and so on. ... Specifically, given a recursive linear order in which the existen- tial formulas uniformly denote recursive relations, one undertakes the construction of a similar isomorphic structure which is not recursively ...
In order to do that, we show how the steady-state dynamical properties of the two dimensional array of non-identical oscillators are related to the equilibrium properties of the XY model with quenched ... We propose a novel set of recursion relations to study this system within the Migdal Kadanoff renormalization group scheme, by mean of the discrete clock-state formulation. ... The author benefited also from brief but interesting discussions with colleagues during the conference in honour of Professor Sherrington, on the occasion of his 65th birthday. ...doi:10.1088/1751-8113/41/32/324021 fatcat:nlrqofbl7zgitilvlqyase2uoe
For a recursive model 2, a relation R C %” is said to be intrinsically re- cursively enumerable (r.e.) if for any isomorphism of the model &% onto a recursive model the image of R is r.e. C. J. ... The author proves that if a model is existentially decidable, then any intrinsically r.e. relation on it is formaily Il). ...
Motivated by a conjecture of Ellentuck concerning fibers f^x(C), f recursive and C an element of one of Barback's "tame models" (Tame models in the isols, Houston J. ... The principal results are that (1) all existentially complete Nerode semirings meet all of their recursive fibers, and (2) not all Nerode semirings meet all of their recursive fibers. ... What we are asking is: can the recursive relations, in the above statement of [6, Theorem 2] , be expanded to the lPx relations? The answer is no. have N(C) N ER(C). ...doi:10.1090/s0002-9939-1993-1116268-9 fatcat:utfnupfu6fdnrnam447p7jjpem
Motivated by a conjecture of Ellentuck concerning fibers f^x(C), f recursive and C an element of one of Barback's "tame models" (Tame models in the isols, Houston J. ... The principal results are that (1) all existentially complete Nerode semirings meet all of their recursive fibers, and (2) not all Nerode semirings meet all of their recursive fibers. ... What we are asking is: can the recursive relations, in the above statement of [6, Theorem 2] , be expanded to the lPx relations? The answer is no. have N(C) N ER(C). ...doi:10.2307/2159545 fatcat:3y5n3y3oyjdghhlcg5i2c6uece
On recursive models of formalised arithmetic. Bull. Acad. Polon. Sci. Cl. III. 5 (1957), 705-710, LXII. ... An analogous result is established for recursively enumerable models, and, by a remark of Putnam [J. Symb. Logic 22 (1957), 110-111] also for one number quantifier models with recursive scope. ...
He introduces a notion of A-forcing to expound the properties of saturated models. The remainder of the book continues to employ games to organize the study of “largeness” properties. ... The author shows some propositions and remarks on definable equivalence relations in O-minimal structures. ...
zero has the independence property if and only if one of the associated theories—i.e., the theory of the residue field or the (ordered, abelian) value group—has the property. ... In ordinary model theory saturated models enjoy a number of existence, uniqueness, and embedding properties. ...
This property usually fails for location-based semantics because in such models it is possible to 68Q Theory of computing 88b:68128 distinguish between terms on the basis of their effect on individual ... The semantic model is not based on locations, but instead uses an abstract sharing relation on identifiers to repre- sent the notion of aliasing, and uses an abstract state with a stack- like structure ...
Summary: “Let be a recursive structure, and let R be a recursive relation on . V. S. Harizanov [Ann. Pure Appl. ... A dynamic property is one that relates the enumeration of the de- sired enumerable set with the other enumerations. ...
We state a universality property of the acceptable numerations, classify some index sets and discuss their relation to other decision problems. ... The last facts are similar to the existence of acceptable numerations of r.e. sets and creative sets. ... From Theorem 2.4 it follows that the degree of a property does not depend on the acceptable numeration: index sets of any property in any two given acceptable numerations are recursively isomorphic. ...doi:10.1016/0168-0072(94)00050-6 fatcat:lcyifhl3i5cxvi3svtvptgz5im
Physical Review D
We show how to solve this problem in the case of the SU(N) non-linear sigma model, i.e. non-renormalizable model with infinite number of interaction vertices, using scaling properties of the semi-on-shell ... currents, and we present new on-shell recursion relations for all on-shell tree-level amplitudes in this theory. ... This work is supported in part by projects MSM0021620859 of the Czech Ministry of Education and GAUK-514412. ...doi:10.1103/physrevd.87.081701 fatcat:m2zixnkddfcojow3ao3zwxwgpa
Variant Construction from Theoretical Foundation to Applications
In this chapter, an edge accuracy model is proposed on digital images and five types of edge detection methods are discussed as examples to investigate their edge maps undertaken recursive operations. ... This provides general mechanism in relation to accurate edge extractions from digital images. ... Such invariant of recursive operations can be observed as intrinsic properties in relation to the edge detection operators themselves. ...doi:10.1007/978-981-13-2282-2_12 fatcat:r5rnr4puyncklizc4ihriput7e
« Previous Showing results 1 — 15 out of 346,512 results