См. также в других словарях:
Boolean — Boo‧le‧an [ˈbuːliən] adjective [only before a noun] COMPUTING relating to a type of logic in which something can be either true or false, but not both: • online systems which make use of Boolean logic • a Boolean search (= a search for… … Financial and business terms
Boolean operators — For the mathematical function, click here: Boolean function Boolean Operators are words or marks typed in some search engines search box to show specific webpages with certain phrases or words together or omitted. The term is derived from Boolean … Wikipedia
True quantified Boolean formula — The language TQBF is a formal language in computer science that contains True Quantified Boolean Formulas. A fully quantified boolean formula is a formula in first order logic where every variable is quantified (or bound), using either… … Wikipedia
Congressional Research Service — Agency overview Formed 1914 Headquarters Washington, DC Agency executives … Wikipedia
Technical Information Project — The Technical Information Project (TIP) was an early database project. TIP included over 25,000 records and was used to explore bibliographic coupling between works.Developed by Meyer Mike Kessler at MIT around 1964, some of the innovations in… … Wikipedia
Text Executive Programming Language — In 1979, Honeywell Information Systems announced a new programming language for their time sharing service named TEX, an acronym for the Text Executive processor. TEX was a first generation scripting language, developed around the time of AWK and … Wikipedia
Glossary of library and information science — This page is a glossary of library and information scienceAlphanumericTOC align=center nobreak= numbers= externallinks= references= top=|A*abstract a brief set of statements that summarize, classifies, evaluates, or describes the important points … Wikipedia
2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… … Wikipedia
Full text search — In text retrieval, full text search refers to a technique for searching a computer stored document or database. In a full text search, the search engine examines all of the words in every stored document as it tries to match search words supplied … Wikipedia
Concept Search — A concept search (or conceptual search) is an automated information retrieval method that is used to search electronically stored unstructured text (for example, digital archives, email, scientific literature, etc.) for information that is… … Wikipedia
Decision tree model — In computational complexity and communication complexity theories the decision tree model is the model of computation or communication in which an algorithm or communication process is considered to be basically a decision tree, i.e., a sequence… … Wikipedia
