Related to Backward chaining

Inference engineIn the field of artificial intelligence, an inference engine is a software component of an intelligent system that applies logical rules to the knowledge base to deduce new information. The first inference engines were components of expert systems. The typical expert system consisted of a knowledge base and an inference engine. The knowledge base stored facts about the world. The inference engine applied logical rules to the knowledge base and deduced new knowledge.

InferenceInferences are steps in logical reasoning, moving from premises to logical consequences. Inference is traditionally divided into deduction and induction, a distinction that dates at least to Aristotle (300s BC). A third type of inference, abduction, has been proposed, notably by Charles Sanders Peirce. Deduction is inference derivinglogical conclusions from premises known or assumed to be true, with the laws of valid inference being studied in logic.

Backward inductionBackward induction is the process of determining a sequence of optimal choices by reasoning from the endpoint of a problem or situation back to its beginning using individual events or actions. Backward induction involves examining the final point in a series of decisions and identifying the optimal process or action required to arrive at that point. This process continues backward until the best action for every possible point along the sequence is determined.

Modus ponensIn propositional logic, modus ponens (; MP), also known as modus ponendo ponens (from Latin'mode that by affirming affirms'), conditional elimination, implication elimination, or affirming the antecedent, is a deductiveargument form and rule of inference. It can be summarized as "PimpliesQ. P is true. Therefore, Q must also be true." Modus ponens is a mixed hypothetical syllogism and is closely related to another valid form of argument, modus tollens.

Logic programmingProgramming paradigm based on formal logicLogic programming is a programming, database, and knowledge representation paradigm based on formal logic. A logic program is a set of sentences in logical form, representing knowledge about some problem domain. Computation is performed by applying logical reasoning to that knowledge, to solve problems in the domain. Major logic programming language families include Prolog, Answer Set Programming (ASP), and Datalog.

Retrograde analysisIn chess problems, retrograde analysis is a technique employed to determine which moves were played leading up to a given position. While this technique is rarely needed for solving ordinary chess problems, there is a whole subgenre of chess problems in which it plays an important part; such problems are known as retros. Retros may ask, for example, for a mate in two, but the main puzzle is in explaining the history of the position.

Computer chessComputer hardware and software capable of playing chess1990s pressure-sensory chess computer with LCD screenComputer chess includes both hardware (dedicated computers) and software capable of playing chess. Computer chess provides opportunities for players to practice even in the absence of human opponents, and also provides opportunities for analysis, entertainment and training.

Chess endgameThe endgame (or ending) is the final stage of a chess game which occurs after the middlegame. It begins when few pieces are left on the board. The line between the middlegame and the endgame is often not clear, and may occur gradually or with a quick exchange of pieces. The endgame, however, tends to have different characteristics from the middlegame, and the players have correspondingly different strategic concerns.

SLD resolutionSLD resolution (Selective Linear Definite clause resolution) is the basic inference rule used in logic programming. It is a refinement of resolution that is both sound and refutation complete for Horn clauses.

Artificial intelligenceArtificial intelligence (AI) is the capability of computational systems to perform tasks typically associated with human intelligence, such as learning, reasoning, problem-solving, perception, and decision-making.

Proof assistantIn computer science and mathematical logic, a proof assistant or interactive theorem prover is a software tool to assist with the development of formal proofs by human–machine collaboration. This involves some sort of interactive proof editor, or other interface, with which a human can guide the search for proofs, the details of which are stored in, and some steps provided by, a computer.

Game theoryMathematical models of strategic interactionsGame theory is the field of applied mathematics that models interactions between multiple agents as "games" of strategy between "players". It is a scientific method of describing, predicting, evaluating, and selecting choices (or "actions"), often with the view of maximising utility outcomes (or "payoffs") for one or more players.

SubgameIn game theory, a subgame is any part (a subset) of a game that meets the following criteria (the following terms allude to a game described in extensive form): It has a single initial node that is the only member of that node's information set (i.e. the initial node is in a singleton information set).If a node is contained in the subgame then so are all of its successors.If a node in a particular information set is in the subgame then all members of that information set belong to the subgame.It is a notion used in the solution concept of subgame perfect Nash equilibrium, a refinement of the Nash equilibrium that eliminates non-credible threats.