Logic in information science
The logic is fundamental fundamentals of information science as sciences. Elements and the foundation of a logic theory are laid in logic gates and the computers logic devices, in bases of algorithmization and programming languages, in procedures of information search in databases and on the Internet and also in the systems of logical programming, knowledge bases and expert systems on a computer.
Content |
Logic in information science
The logic in information science as to a subject matter was entered in' the very first textbooks by information science Kaymina in 1985 and in the textbook by information science of Kaiming for high schools in 1987-89gg. The paradox is in what the first school textbooks by information science of Yershov, Kushnirenko and many existing textbooks by information science for schools and universities of the logician is absent.
In 2004 in Russia Uniform examinations of the Unified State Examination in information science in which content studying and knowledge of fundamentals of logic became obligatory were entered. The logic in information science is used in information search in the Internet, in databases, in knowledge bases, in algorithms, algorithmization and in all programming languages.
The greatest value of the logician purchases in the analysis algorithms and programs at solving of tasks on a computer when estimates at examinations or a victory at the Olympic Games on information science or programming depend on results of solving of tasks.
Lack of errors in algorithms and programs on a computer - key criterion for a victory at the regional, Russian and international Olympic Games and the championships on information science and programming. Not accidentally our Russian school students and students systematically win from year to year at these computer competitions.
Logic in programming
The most serious problem for information science and computer sciences is existence of errors in the algorithms and programs published in textbooks and manuals and also inability teachers and teachers of information science to reveal and correct errors in the algorithms and programs made by pupils.
Testing of programs can reveal existence of errors in programs, but cannot guarantee their absence. Guarantees of lack of errors in algorithms and programs can give only proofs of their correctness. The algorithm does not contain errors if it gives the correct solutions for all legal data.
The only way for overcoming these problems is studying to systematic methods of drawing up algorithms and programs with the simultaneous analysis of their correctness within evidential programming from the very beginning of training in bases of algorithmization and programming.
The complexity for teachers of information science and professional programmers is that they should be able to write not only algorithms and programs without errors, but also at the same time to write correctness proofs of the algorithms and programs. What now neither mathematicians, nor programmers, nor teachers of information science are able to do.
As a result "professional" programmers write programs with a large number of errors which they cannot neither reveal, nor correct. Massive testing of programs for a computer brings to programmers undoubted benefit, however does not give guarantees of complete disposal of errors.
Practice of application and evidential programming methods showed that this technology is quite available to students of mathematical faculties who quite can do writing of correctness proofs of algorithms, after check and testing of programs for a computer.
The greatest effect in mastering of technologies of evidential programming is observed on ekzamanekh on information science in mathematical and economic universities where students cope also with solving of tasks on a computer and writing of correctness proofs of algorithms and programs.
Intuitive methods of the analysis of correctness of algorithms and programs are characteristic of the Olympic Games on information science and programming where winners and prize-winners are those students who mastered technology of testing of programs for a computer and drawing up algorithms and programs without errors.
- VAK, prof., dock. computer. sciences 12:43 p.m., on July 3 2009 (UTC)
Logic and artificial intelligence
In information science problems of artificial intelligence are considered from positions of design of expert systems and knowledge bases. Knowledge bases are understood as a data set and the inference rules allowing a logical output and intelligent information processing.
In general researches of problems of artificial intelligence in information science it is directed to creation, development and operation of intelligent information systems, including questions of training of users and developers of such systems.
Logical approach to creation of the systems of artificial intelligence is directed to creation of expert systems with logical models of knowledge bases using language of predicates.
The training model of the systems of artificial intelligence in the 1980th years accepted language and the system of logical programming the Prologue used for creation of knowledge bases and models of expert systems on a computer.
Knowledge bases in the Prologue language represent sets of the facts and rules of a logical output written language of logical predicates using lexicon of Russian, it is well clear to Russians, Kazakhs, Ukrainians — all Russian-speaking people. Cases of writing of programs and knowledge bases using Russian-speaking interpreters of a Prologue in Kazakh are known.
The logical model of knowledge bases allows to write not only specific data and data in the form of the facts in the Prologue language, but also the generalized data using rules and procedures of a logical output and including logical rules of determination of the concepts expressing certain knowledge as the specific and generalized data.
In general researches of problems of artificial intelligence in information science within the logical design approach of knowledge bases and expert systems it is directed to creation, development and operation of intelligent information systems, including issues of training of school and university students and also training of users and developers of such intelligent information systems
Logic and logical programming
'Logical programming' — the programming paradigm based on the automatic theorem proving using information inference engines on the basis of the set facts and inference rules. The Prologue language and logical programming are also widely used for creation of knowledge bases and expert systems and researches in the field of artificial intelligence on the basis of logical models of knowledge bases and logical procedures of an output and decision making.
Language and the system of logical programming a Prologue are based on language of predicate calculus, the logic of first order representing a subset. The main in the Prologue language are concepts of the facts and rules of a logical output and also requests for search and information output in knowledge bases.
Procedures of a logical output and decision making on the basis of which the system of logical programming a Prologue draws logical conclusions and gives intelligent answers. The facts in the Prologue language are described by logical predicates with specific values. Rules in a Prologue register in the form of rules of a logical output with the logical conclusions and the list of logical conditions.
Logic in databases
The database — an objective form of representation and the organization of a data set systematized so that these data could be found and processed using a computer. Databases are applied in all spheres of human activity integrated taking into account and information storage.
Separate flat databases in which all information is had in the only table in which each entry contains the identifier of a specific object and relational databases consisting of several tables between which connection is established with the help of matching values of the fields of the same name.
the relational model of databases de facto is the standard. In relational bases data are stored in a type of the tables consisting of lines and columns. Each table has own, predeterminated set of the referred to as fields. Columns of tables of relational base may contain scalar data of the fixed type, for example numbers, lines or dates.
Information search in relational databases is carried out using language of requests of SQL (engl. Structured Query Language is a structured query language) — the universal computer language applied to creation, search and modification of information in databases.
Language of requests of SQL to relational databases consists of operators of determination, search and information processing in databases. Operators of information search to contain logical search conditions which can be simple and difficult compound.
Simple conditions in the SQL language have an appearance of equalities and inequalities like name = value where the name is a column name in the table, and value - specific numerical or character value (depending on column type in the table).
Slozhnosostavny conditions in requests in the SQL language register using logical connectives of AND (I), OR (ILI), NOT (NE) expressing logical expressions there are information search conditions in relational databases.
From the logical point of view of search condition in requests of SQL completely correspond to propositional calculus (with equalities) - it is completely equivalent to propositional logic of Aristotle - the original author in the history of the textbook logically and the first three laws of logic (Aristotle's laws).
See Also
Unified State Examination in information science and ICT
Text of heading
Literature
- Kaiming V. A . Information science. The textbook for students. M.: INFRA-M, 1998-2009.
- Kaiming V. A . Information science. The textbook for arriving. M.: Avenue, 2009.
- Kaiming V. A . Information science. A benefit to examinations. M.: RIOR, 2008.
- Ivan Bratko Algoritmy of artificial intelligence in the PROLOG language = Prolog Programming For Artificial Intelligence. — M.: Williams, 2004. — Page 640. — ISBN 0-201-40375-7
- Hunt E. Artificial intelligence = Artificial intelligence / Under the editorship of V.L. Stefanyuk. — M.: World, 1978. — 558 pages.
- K.J. Deyt Introduction to database systems = Introduction to Database Systems. — the 8th prod. — M.: Williams, 2006. — Page 1328. — ISBN 0-321-19784-4
Internet links
- Technologies of Evidential Programming
- Programming methodology in St. Petersburg
- Prolog and Logical programming
- Language and Interpreter of a Prologue
- Technologies of Evidential Programming
- Information science at Schools and Universities
- Order of textbooks via the Internet
- Blog: Logic and a Prologue in Information science
- VAK, prof., dock. computer. sciences 5:33 a.m., on August 27 2009 (UTC)