Some competition programming problems as the beginning of artificial intelligence

Authors:
Boris Melnikov;Elena Melnikova
Affiliations:
Department of Mathematics and Information Science, Togliatti State Univ., Togliatti, Russia;Department of Mathematics and Information Science, Togliatti State Univ., Togliatti, Russia
Venue:
Informatics in education
Year:
2007

Citing 4
Cited 0

Prolog (3rd ed.): programming for artificial intelligence

Prolog (3rd ed.): programming for artificial intelligence
Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics

Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Discrete Optimization Problems - Some New Heuristic Approaches

HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider in this paper some programming competition problems (which are near to some problems of ACM competitions) of the following subjects: we can make their solution using both Prolog and a classical procedure-oriented language. Moreover, the considered problems are selected that their solution in Prolog and in a classical procedure-oriented language are similar - i.e., in other words, they use the same working mechanism, the same approach to constructing recursive functions etc. However, the main goal of this paper is to demonstrate, that the solution of most of these problems by the students is a step to design the real problems of artificial intellegence.