monotonic problem
Смотреть что такое "monotonic problem" в других словарях:
Non-monotonic logic — A non monotonic logic is a formal logic whose consequence relation is not monotonic. Most studied formal logics have a monotonic consequence relation, meaning that adding a formula to a theory never produces a reduction of its set of consequences … Wikipedia
Frame problem — In artificial intelligence, the frame problem was initially formulated as the problem of expressing a dynamical domain in logic without explicitly specifying which conditions are not affected by an action. John McCarthy and Patrick J. Hayes… … Wikipedia
Rate-monotonic scheduling — In computer science, rate monotonic scheduling [citation|first1=C. L.|last1=Liu|authorlink1=Chung Laung Liu|first2=J.|last2=Layland|title=Scheduling algorithms for multiprogramming in a hard real time environment|journal=Journal of the ACM|volume … Wikipedia
Happy Ending problem — The Happy Ending problem (so named by Paul Erdős since it led to the marriage of George Szekeres and Esther Klein) is the following statement::Theorem. Any set of five points in the plane in general position [In this context, general position… … Wikipedia
Hausdorff moment problem — In mathematics, the Hausdorff moment problem, named after Felix Hausdorff, asks for necessary and sufficient conditions that a given sequence { mn : n = 0, 1, 2, ... } be the sequence of moments of… … Wikipedia
Ramification problem — In philosophy and AI (especially, knowledge based systems), the ramification problem is concerned with indirect consequences of an action. It might be posed as how to represent what happens implicitly due to an action or to control secondary and… … Wikipedia
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… … Wikipedia
Mechanism design — The Stanley Reiter diagram above illustrates a game of mechanism design. The upper left space Θ depicts the type space and the upper right space X the space of outcomes. The social choice function f(θ) maps a type profile to an outcome. In games… … Wikipedia
Belief revision — is the process of changing beliefs to take into account a new piece of information. The logical formalization of belief revision is researched in philosophy, in databases, and in artificial intelligence for the design of rational agents.What… … Wikipedia
Catalan number — For names of numbers in Catalan, see List of numbers in various languages#Occitano Romance. In combinatorial mathematics, the Catalan numbers form a sequence of natural numbers that occur in various counting problems, often involving recursively… … Wikipedia
Dedekind number — … Wikipedia
