Results 271 to 280 of about 743,255 (314)
Some of the next articles are maybe not open access.
Journal of Symbolic Logic, 1968
A theory T is axiomatizable by a schema if there is a formula Γ, involving symbols of T plus a new relation symbol R, such that the set of all (universal closures of) instances of Γ in T is a set of axioms for T. (It is understood that, if R has n places, an instance of Γ in T is obtained by properly substituting for R in Γ a formula of T which has n ...
openaire +2 more sources
A theory T is axiomatizable by a schema if there is a formula Γ, involving symbols of T plus a new relation symbol R, such that the set of all (universal closures of) instances of Γ in T is a set of axioms for T. (It is understood that, if R has n places, an instance of Γ in T is obtained by properly substituting for R in Γ a formula of T which has n ...
openaire +2 more sources
Translating Relational Schema With Constraints Into OODB Schema
1993Abstract We consider the problem of translating a relational database schema into that of an object-oriented database. Our approach is designed to extract semantics by investigating into the structure of relations, their key constraints, and inclusion/referential constraints. These constraints can be existing ones from the schema or they can be given
Yan, Ling-Ling, Ling, Tok-Wang
openaire +1 more source
1993
Made-Up Minds addresses fundamental questions of learning and concept invention by means of an innovative computer program that is based on the cognitive-developmental theory of psychologist Jean Piaget. Drescher uses Piaget's theory as a source of inspiration for the design of an artificial cognitive system called the schema mechanism, and then uses ...
openaire +1 more source
Made-Up Minds addresses fundamental questions of learning and concept invention by means of an innovative computer program that is based on the cognitive-developmental theory of psychologist Jean Piaget. Drescher uses Piaget's theory as a source of inspiration for the design of an artificial cognitive system called the schema mechanism, and then uses ...
openaire +1 more source
Schema Homomorphism – An Algebraic Framework for Schema Matching
2005A formal framework for SMP is important because it facilitates the building of algorithm model and the evaluation of algorithms. First, we propose a formal definition of schema matching that is named multivalent matching, i.e., an individual of source schema can be associated with a set of individuals of target schema.
Zhang, Z. +4 more
openaire +1 more source
A method for transforming relational schemas into conceptual schemas
Proceedings of 1994 IEEE 10th International Conference on Data Engineering, 2002A major problem with currently existing database systems is that there often does not exist a conceptual understanding of the data. Such an understanding can be obtained by describing the data using a semantic data model, such as the ER model. Consequently, there is a need for methods that translate a schema in a traditional data model into a ...
openaire +1 more source
Data schema design as a schema evolution process
Data & Knowledge Engineering, 1997Summary: In an information system a key role is played by the underlying data schema. This article starts out from the view that the entire modelling process of an information system's data schema can be seen as a schema transformation process. A transformation process that starts out with an initial draft conceptual schema and ends with an internal ...
openaire +2 more sources
Early Maladaptive Schemas and Schema Modes in clinical disorders: A systematic review
Psychology and Psychotherapy: Theory, Research and Practice, 2023Andreas Bar +2 more
exaly
2015 IEEE/ACS 12th International Conference of Computer Systems and Applications (AICCSA), 2015
Samir Anter, Ahmed Zellou, Ali Idri
openaire +1 more source
Samir Anter, Ahmed Zellou, Ali Idri
openaire +1 more source
Paranoia and negative schema about the self and others: A systematic review and meta-analysis
Clinical Psychology Review, 2021Sandra Bucci +2 more
exaly

