The theorem proving system finds a way to combine the axioms to prove the theorem, and in the process, it completes the desired calculation.
"Sinopsis" puede pertenecer a otra edición de este libro.
powerful operations on them. An early step in this direction was the development of APl, and more recent examples have been SETl which enables a user to code in terms of mathematical enti ties such as sets and BDl which allows a user, presumably a businessman, to specify a computation in terms of a series of tabular forms and a series of processing paths through which data flows. The design and implementation of such languages are examined in chapters by P. GOLDBERG. Another extension to traditional methods is made possible by systems designed to automatically handle low level flow-of control decisions. All the above higher level languages do this implicitly with their built in operators. PROLOG is a language which does this with a theorem proving mechanism employing primarily unification and backtracking. The programmer specifies the problem to be solved with a set of formal logic statements including a theorem to be proved. The theorem proving system finds a way to combine the axioms to prove the theorem, and in the process, it completes the desired calculation. H. GAllAIRE has contributed a chapter describing PROLOG giving many examples of its usage.
Proceedings of the NATO Advanced Study Institute, Bonas, France, September 28-October 10, 1981
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9789400970212_new
Cantidad disponible: Más de 20 disponibles
Librería: moluna, Greven, Alemania
Condición: New. Proceedings of the NATO Advanced Study Institute, Bonas, France, September 28-October 10, 1981 powerful operations on them. An early step in this direction was the development of APl, and more recent examples have been SETl which enables a user to code. Nº de ref. del artículo: 5829127
Cantidad disponible: Más de 20 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Paperback. Condición: Brand New. 374 pages. 9.45x6.30x0.88 inches. In Stock. Nº de ref. del artículo: x-9400970218
Cantidad disponible: 2 disponibles
Librería: Mispah books, Redhill, SURRE, Reino Unido
Paperback. Condición: Like New. Like New. book. Nº de ref. del artículo: ERICA79794009702186
Cantidad disponible: 1 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Taschenbuch. Condición: Neu. Neuware - powerful operations on them. An early step in this direction was the development of APl, and more recent examples have been SETl which enables a user to code in terms of mathematical enti ties such as sets and BDl which allows a user, presumably a businessman, to specify a computation in terms of a series of tabular forms and a series of processing paths through which data flows. The design and implementation of such languages are examined in chapters by P. GOLDBERG. Another extension to traditional methods is made possible by systems designed to automatically handle low level flow-of control decisions. All the above higher level languages do this implicitly with their built in operators. PROLOG is a language which does this with a theorem proving mechanism employing primarily unification and backtracking. The programmer specifies the problem to be solved with a set of formal logic statements including a theorem to be proved. The theorem proving system finds a way to combine the axioms to prove the theorem, and in the process, it completes the desired calculation. H. GAllAIRE has contributed a chapter describing PROLOG giving many examples of its usage. Nº de ref. del artículo: 9789400970212
Cantidad disponible: 2 disponibles