Organizational learningOrganizational learning is the process of creating, retaining, and transferring knowledge within an organization. An organization improves over time as it gains experience. From this experience, it is able to create knowledge. This knowledge is broad, covering any topic that could better an organization. Examples may include ways to increase production efficiency or to develop beneficial investor relations. Knowledge is created at four different units: individual, group, organizational, and inter organizational.
Market (economics)In economics, a market is a composition of systems, institutions, procedures, social relations or infrastructures whereby parties engage in exchange. While parties may exchange goods and services by barter, most markets rely on sellers offering their goods or services (including labour power) to buyers in exchange for money. It can be said that a market is the process by which the prices of goods and services are established. Markets facilitate trade and enable the distribution and allocation of resources in a society.
Data miningData mining is the process of extracting and discovering patterns in large data sets involving methods at the intersection of machine learning, statistics, and database systems. Data mining is an interdisciplinary subfield of computer science and statistics with an overall goal of extracting information (with intelligent methods) from a data set and transforming the information into a comprehensible structure for further use. Data mining is the analysis step of the "knowledge discovery in databases" process, or KDD.
Constraint logic programmingConstraint logic programming is a form of constraint programming, in which logic programming is extended to include concepts from constraint satisfaction. A constraint logic program is a logic program that contains constraints in the body of clauses. An example of a clause including a constraint is . In this clause, is a constraint; A(X,Y), B(X), and C(Y) are literals as in regular logic programming. This clause states one condition under which the statement A(X,Y) holds: X+Y is greater than zero and both B(X) and C(Y) are true.
Public choicePublic choice, or public choice theory, is "the use of economic tools to deal with traditional problems of political science". Its content includes the study of political behavior. In political science, it is the subset of positive political theory that studies self-interested agents (voters, politicians, bureaucrats) and their interactions, which can be represented in a number of ways – using (for example) standard constrained utility maximization, game theory, or decision theory.
Contestable marketIn economics, the theory of contestable markets, associated primarily with its 1982 proponent William J. Baumol, held that there are markets served by a small number of firms that are nevertheless characterized by competitive equilibrium (and therefore desirable welfare outcomes) because of the existence of potential short-term entrants. A perfectly contestable market has three main features: No entry or exit barriers No sunk costs Access to the same level of technology (to incumbent firms and new entrants) A perfectly contestable market is not possible in real life.
Constraint Handling RulesConstraint Handling Rules (CHR) is a declarative, rule-based programming language, introduced in 1991 by Thom Frühwirth at the time with European Computer-Industry Research Centre (ECRC) in Munich, Germany. Originally intended for constraint programming, CHR finds applications in grammar induction, type systems, abductive reasoning, multi-agent systems, natural language processing, compilation, scheduling, spatial-temporal reasoning, testing, and verification.
Axiom of countable choiceThe axiom of countable choice or axiom of denumerable choice, denoted ACω, is an axiom of set theory that states that every countable collection of non-empty sets must have a choice function. That is, given a function A with domain N (where N denotes the set of natural numbers) such that A(n) is a non-empty set for every n ∈ N, there exists a function f with domain N such that f(n) ∈ A(n) for every n ∈ N. The axiom of countable choice (ACω) is strictly weaker than the axiom of dependent choice (DC), which in turn is weaker than the axiom of choice (AC).
Single marketA single market, sometimes called common market or internal market, is a type of trade bloc in which most trade barriers have been removed (for goods) with some common policies on product regulation, and freedom of movement of the factors of production (capital and labour) and of enterprise and services. The goal is that the movement of capital, labour, goods, and services between the members is as easy as within them. The physical (borders), technical (standards) and fiscal (taxes) barriers among the member states are removed to the maximum extent possible.
Axiom of global choiceIn mathematics, specifically in class theories, the axiom of global choice is a stronger variant of the axiom of choice that applies to proper classes of sets as well as sets of sets. Informally it states that one can simultaneously choose an element from every non-empty set. The axiom of global choice states that there is a global choice function τ, meaning a function such that for every non-empty set z, τ(z) is an element of z.
