| slovo | definícia |
inference
(encz) | inference,dedukce n: Zdeněk Brož |
inference
(encz) | inference,odvození n: Zdeněk Brož |
Inference
(gcide) | Inference \In"fer*ence\, n. [From Infer.]
[1913 Webster]
1. The act or process of inferring by deduction or induction.
[1913 Webster]
Though it may chance to be right in the conclusions,
it is yet unjust and mistaken in the method of
inference. --Glanvill.
[1913 Webster]
2. That which inferred; a truth or proposition drawn from
another which is admitted or supposed to be true; a
conclusion; a deduction. --Milton.
[1913 Webster]
These inferences, or conclusions, are the effects of
reasoning, and the three propositions, taken all
together, are called syllogism, or argument. --I.
Watts.
Syn: Conclusion; deduction; consequence.
Usage: Inference, Conclusion. An inference is literally
that which is brought in; and hence, a deduction or
induction from premises, -- something which follows as
certainly or probably true. A conclusion is stronger
than an inference; it shuts us up to the result, and
terminates inquiry. We infer what is particular or
probable; we conclude what is certain. In a chain of
reasoning we have many inferences, which lead to the
ultimate conclusion. "An inference is a proposition
which is perceived to be true, because of its
connection with some known fact." "When something is
simply affirmed to be true, it is called a
proposition; after it has been found to be true by
several reasons or arguments, it is called a
conclusion." --I. Taylor.
[1913 Webster] |
inference
(wn) | inference
n 1: the reasoning involved in drawing a conclusion or making a
logical judgment on the basis of circumstantial evidence
and prior conclusions rather than on the basis of direct
observation [syn: inference, illation] |
inference
(foldoc) | inference
The logical process by which new facts are derived
from known facts by the application of inference rules.
See also symbolic inference, type inference.
(1995-03-20)
|
INFERENCE
(bouvier) | INFERENCE. A conclusion drawn by reason from premises established by proof.
2. It is the province of the judge who is to decide upon the facts to
draw the inference. When the facts are submitted to the court, the judges
draw the inference; when they are to be ascertained by a jury, it is their
duty to do so. The witness is not permitted as a general rule to draw an
inference, and testify that to the court or jury. It is his duty to state
the facts simply as they occurred. Inferences differ from presumptions.
(q.v.)
|
| | podobné slovo | definícia |
inference
(encz) | inference,dedukce n: Zdeněk Brožinference,odvození n: Zdeněk Brož |
inference rule
(encz) | inference rule,odvozovací pravidlo n: [mat.] Ivan Masár |
inferences
(encz) | inferences,důsledky n: pl. Zdeněk Brož |
rule of inference
(encz) | rule of inference,odvozovací pravidlo n: [mat.] Ivan Masár |
statistical inference
(encz) | statistical inference, |
Inference
(gcide) | Inference \In"fer*ence\, n. [From Infer.]
[1913 Webster]
1. The act or process of inferring by deduction or induction.
[1913 Webster]
Though it may chance to be right in the conclusions,
it is yet unjust and mistaken in the method of
inference. --Glanvill.
[1913 Webster]
2. That which inferred; a truth or proposition drawn from
another which is admitted or supposed to be true; a
conclusion; a deduction. --Milton.
[1913 Webster]
These inferences, or conclusions, are the effects of
reasoning, and the three propositions, taken all
together, are called syllogism, or argument. --I.
Watts.
Syn: Conclusion; deduction; consequence.
Usage: Inference, Conclusion. An inference is literally
that which is brought in; and hence, a deduction or
induction from premises, -- something which follows as
certainly or probably true. A conclusion is stronger
than an inference; it shuts us up to the result, and
terminates inquiry. We infer what is particular or
probable; we conclude what is certain. In a chain of
reasoning we have many inferences, which lead to the
ultimate conclusion. "An inference is a proposition
which is perceived to be true, because of its
connection with some known fact." "When something is
simply affirmed to be true, it is called a
proposition; after it has been found to be true by
several reasons or arguments, it is called a
conclusion." --I. Taylor.
[1913 Webster] |
inference
(wn) | inference
n 1: the reasoning involved in drawing a conclusion or making a
logical judgment on the basis of circumstantial evidence
and prior conclusions rather than on the basis of direct
observation [syn: inference, illation] |
complete inference system
(foldoc) | complete inference system
An inference system A is complete with respect to
another system B if A can reach every conclusion which is true
in B. The dual to completeness is soundness.
(1998-07-05)
|
grammatical inference
(foldoc) | grammatical inference
computational learning
inductive inference
Deducing a grammar from given examples. Also known as
"inductive inference" and recently as "computational
learning".
|
inductive inference
(foldoc) | grammatical inference
computational learning
inductive inference
Deducing a grammar from given examples. Also known as
"inductive inference" and recently as "computational
learning".
|
inference
(foldoc) | inference
The logical process by which new facts are derived
from known facts by the application of inference rules.
See also symbolic inference, type inference.
(1995-03-20)
|
inference engine
(foldoc) | inference engine
A program that infers new facts from known facts using
inference rules. Commonly found as part of a Prolog
interpreter, expert system or knowledge based system.
(1994-11-01)
|
inference rule
(foldoc) | inference rule
A procedure which combines known facts to produce
("infer") new facts. For example, given that
1. Socrates is a man and that
2. all men are motal,
we can infer that Socrates is mortal. This uses the rule
known as "modus ponens" which can be written in {Boolean
algebra} as
(A & A => B) => B
(if proposition A is true, and A implies B, then B is true).
Or given that,
1. Either Denis is programming or Denis is sad and
2. Denis is not sad,
we can infer that Denis is programming. This rule can be
written
((A OR B) & not B) => A
(If either A is true or B is true (or both), and B is false,
then A must be true).
Compare syllogism.
(1994-10-31)
|
symbolic inference
(foldoc) | symbolic inference
The derivation of new facts from known facts and {inference
rules}. This is one of the fundamental operations of
artificial intelligence and logic programming languages
like Prolog.
Inference is a basic part of human reasoning. For example
given that all men are mortal and that Socrates is a man, it
is a trivial step to infer that Socrates is mortal. We might
express these symbolically:
man(X) => mortal(X).
man(socrates).
("if X is a man then X is mortal" and "Socrates is a man").
Here, "man", "mortal" and "socrates" are just arbitrary
symbols which the computer manipulates without reference to or
knowledge of their external meaning. A forward chaining
system (a production system) could use these to infer the
new fact
mortal(socrates).
simply by matching the left-hand-side of the implication
against the fact and substituting socrates for the variable X.
(1994-10-28)
|
type inference
(foldoc) | type inference
An algorithm for ascribing types to
expressions in some language, based on the types of the
constants of the language and a set of type inference rules
such as
f :: A -> B, x :: A
--------------------- (App)
f x :: B
This rule, called "App" for application, says that if
expression f has type A -> B and expression x has type A then
we can deduce that expression (f x) has type B. The
expressions above the line are the premises and below, the
conclusion. An alternative notation often used is:
G |- x : A
where "|-" is the turnstile symbol (LaTeX \vdash) and G is a
type assignment for the free variables of expression x. The
above can be read "under assumptions G, expression x has type
A". (As in Haskell, we use a double "::" for type
declarations and a single ":" for the infix list constructor,
cons).
Given an expression
plus (head l) 1
we can label each subexpression with a type, using type
variables X, Y, etc. for unknown types:
(plus :: Int -> Int -> Int)
(((head :: [a] -> a) (l :: Y)) :: X)
(1 :: Int)
We then use unification on type variables to match the
partial application of plus to its first argument against
the App rule, yielding a type (Int -> Int) and a substitution
X = Int. Re-using App for the application to the second
argument gives an overall type Int and no further
substitutions. Similarly, matching App against the
application (head l) we get Y = [X]. We already know X = Int
so therefore Y = [Int].
This process is used both to infer types for expressions and
to check that any types given by the user are consistent.
See also generic type variable, principal type.
(1995-02-03)
|
|