|
Ramification Problem
In philosophy and artificial intelligence (especially, knowledge based systems), the ramification problem is concerned with the indirect consequences of an action. It might also be posed as ''how to represent what happens implicitly due to an action'' or how to control the secondary and tertiary effects of an action. It is strongly connected to, and is opposite the qualification side of, the frame problem. Limit theory helps in operational usage. For instance, in KBE derivation of a populated design (geometrical objects, etc., similar concerns apply in shape theory), equivalence assumptions allow convergence where potentially large, and perhaps even computationally indeterminate, solution sets are handled deftly. Yet, in a chain of computation, downstream events may very well find some types of results from earlier resolutions of ramification as problematic for their own algorithms. See also *Non-monotonic logic A non-monotonic logic is a formal logic whose conclusion relatio ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Philosophy
Philosophy (from , ) is the systematized study of general and fundamental questions, such as those about existence, reason, Epistemology, knowledge, Ethics, values, Philosophy of mind, mind, and Philosophy of language, language. Such questions are often posed as problems to be studied or resolved. Some sources claim the term was coined by Pythagoras ( BCE), although this theory is disputed by some. Philosophical methodology, Philosophical methods include Socratic questioning, questioning, Socratic method, critical discussion, dialectic, rational argument, and systematic presentation. in . Historically, ''philosophy'' encompassed all bodies of knowledge and a practitioner was known as a ''philosopher''."The English word "philosophy" is first attested to , meaning "knowledge, body of knowledge." "natural philosophy," which began as a discipline in ancient India and Ancient Greece, encompasses astronomy, medicine, and physics. For example, Isaac Newton, Newton's 1687 ''Phil ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Artificial Intelligence
Artificial intelligence (AI) is intelligence—perceiving, synthesizing, and inferring information—demonstrated by machines, as opposed to intelligence displayed by animals and humans. Example tasks in which this is done include speech recognition, computer vision, translation between (natural) languages, as well as other mappings of inputs. The ''Oxford English Dictionary'' of Oxford University Press defines artificial intelligence as: the theory and development of computer systems able to perform tasks that normally require human intelligence, such as visual perception, speech recognition, decision-making, and translation between languages. AI applications include advanced web search engines (e.g., Google), recommendation systems (used by YouTube, Amazon and Netflix), understanding human speech (such as Siri and Alexa), self-driving cars (e.g., Tesla), automated decision-making and competing at the highest level in strategic game systems (such as chess and G ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Qualification Problem
In philosophy and AI (especially, knowledge-based systems), the qualification problem is concerned with the impossibility of listing ''all'' the preconditions required for a real-world action to have its intended effect. It might be posed as ''how to deal with the things that prevent me from achieving my intended result''. It is strongly connected to, and opposite the ramification side of, the frame problem. John McCarthy gives the following motivating example, in which it is impossible to enumerate all the circumstances that may prevent a rowboat from performing its ordinary function: :" e successful use of a boat to cross a river requires, if the boat is a rowboat, that the oars and rowlocks be present and unbroken, and that they fit each other. Many other qualifications can be added, making the rules for using a rowboat almost impossible to apply, and yet anyone will still be able to think of additional requirements not yet stated." See also *Non-monotonic logic *Circumscript ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Frame Problem
In artificial intelligence, the frame problem describes an issue with using first-order logic (FOL) to express facts about a robot in the world. Representing the state of a robot with traditional FOL requires the use of many axioms that simply imply that things in the environment do not change arbitrarily. For example, Hayes describes a " block world" with rules about stacking blocks together. In a FOL system, additional axioms are required to make inferences about the environment (for example, that a block cannot change position unless it is physically moved). The frame problem is the problem of finding adequate collections of axioms for a viable description of a robot environment. John McCarthy and Patrick J. Hayes defined this problem in their 1969 article, ''Some Philosophical Problems from the Standpoint of Artificial Intelligence''. In this paper, and many that came after, the formal mathematical problem was a starting point for more general discussions of the difficulty of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Operational
An operational definition specifies concrete, replicable procedures designed to represent a construct. In the words of American psychologist S.S. Stevens (1935), "An operation is the performance which we execute in order to make known a concept." For example, an operational definition of "fear" (the construct) often includes measurable physiologic responses that occur in response to a perceived threat. Thus, "fear" might be operationally defined as specified changes in heart rate, galvanic skin response, pupil dilation, and blood pressure. Overview An operational definition is designed to model or represent a concept or theoretical definition, also known as a construct. Scientists should describe the operations (procedures, actions, or processes) that define the concept with enough specificity such that other investigators can replicate their research. Operational definitions are also used to define system states in terms of a specific, publicly accessible process of preparation ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Knowledge-based Engineering
Knowledge-based engineering (KBE) is the application of knowledge-based systems technology to the domain of manufacturing design and production. The design process is inherently a knowledge-intensive activity, so a great deal of the emphasis for KBE is on the use of knowledge-based technology to support computer-aided design (CAD) however knowledge-based techniques (e.g. knowledge management) can be applied to the entire product lifecycle. The CAD domain has always been an early adopter of software-engineering techniques used in knowledge-based systems, such as object-orientation and rules. Knowledge-based engineering integrates these technologies with CAD and other traditional engineering software tools. Benefits of KBE include improved collaboration of the design team due to knowledge management, improved re-use of design artifacts, and automation of major parts of the product lifecycle. Overview KBE is essentially engineering on the basis of knowledge models. A knowledge m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Non-monotonic Logic
A non-monotonic logic is a formal logic whose conclusion relation is not monotonic. In other words, non-monotonic logics are devised to capture and represent defeasible inferences (cf. defeasible reasoning), i.e., a kind of inference in which reasoners draw tentative conclusions, enabling reasoners to retract their conclusion(s) based on further evidence. Most studied formal logics have a monotonic entailment relation, meaning that adding a formula to a theory never produces a pruning of its set of conclusions. Intuitively, monotonicity indicates that learning a new piece of knowledge cannot reduce the set of what is known. A monotonic logic cannot handle various reasoning tasks such as reasoning by default (conclusions may be derived only because of lack of evidence of the contrary), abductive reasoning (conclusions are only deduced as most likely explanations), some important approaches to reasoning about knowledge (the ignorance of a conclusion must be retracted when the conc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ramification (mathematics)
In geometry, ramification is 'branching out', in the way that the square root function, for complex numbers, can be seen to have two ''branches'' differing in sign. The term is also used from the opposite perspective (branches coming together) as when a covering map degenerates at a point of a space, with some collapsing of the fibers of the mapping. In complex analysis In complex analysis, the basic model can be taken as the ''z'' → ''z''''n'' mapping in the complex plane, near ''z'' = 0. This is the standard local picture in Riemann surface theory, of ramification of order ''n''. It occurs for example in the Riemann–Hurwitz formula for the effect of mappings on the genus. See also branch point. In algebraic topology In a covering map the Euler–Poincaré characteristic should multiply by the number of sheets; ramification can therefore be detected by some dropping from that. The ''z'' → ''z''''n'' mapping shows this as a local ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Logic Programming
Logic programming is a programming paradigm which is largely based on formal logic. Any program written in a logic programming language is a set of sentences in logical form, expressing facts and rules about some problem domain. Major logic programming language families include Prolog, answer set programming (ASP) and Datalog. In all of these languages, rules are written in the form of ''clauses'': :H :- B1, …, Bn. and are read declaratively as logical implications: :H if B1 and … and Bn. H is called the ''head'' of the rule and B1, ..., Bn is called the ''body''. Facts are rules that have no body, and are written in the simplified form: :H. In the simplest case in which H, B1, ..., Bn are all atomic formulae, these clauses are called definite clauses or Horn clauses. However, there are many extensions of this simple case, the most important one being the case in which conditions in the body of a clause can also be negations of atomic formulas. Logic programming lan ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Knowledge Representation
Knowledge representation and reasoning (KRR, KR&R, KR²) is the field of artificial intelligence (AI) dedicated to representing information about the world in a form that a computer system can use to solve complex tasks such as diagnosing a medical condition or having a dialog in a natural language. Knowledge representation incorporates findings from psychology about how humans solve problems and represent knowledge in order to design formalisms that will make complex systems easier to design and build. Knowledge representation and reasoning also incorporates findings from logic to automate various kinds of ''reasoning'', such as the application of rules or the relations of sets and subsets. Examples of knowledge representation formalisms include semantic nets, systems architecture, frames, rules, and ontologies. Examples of automated reasoning engines include inference engines, theorem provers, and classifiers. History The earliest work in computerized knowledge rep ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
