Agent-Oriented Programming: From Prolog to Guarded Definite Clauses, Issue 1630
Springer Science & Business Media, Oct 27, 1999 - Computers - 386 pages
A book that furnishes no quotations is, me judice, no book – it is a plaything. TL Peacock: Crochet Castle The paradigm presented in this book is proposed as an agent programming language. The book charts the evolution of the language from Prolog to intelligent agents. To a large extent, intelligent agents rose to prominence in the mid-1990s because of the World Wide Web and an ill-structured network of multimedia information. Age- oriented programming was a natural progression from object-oriented programming which C++ and more recently Java popularized. Another strand of influence came from a revival of interest in robotics [Brooks, 1991a; 1991b]. The quintessence of an agent is an intelligent, willing slave. Speculation in the area of artificial slaves is far more ancient than twentieth century science fiction. One documented example is found in Aristotle’s Politics written in the fourth century BC. Aristotle classifies the slave as “an animate article of property”. He suggests that slaves or subordinates might not be necessary if “each instrument could do its own work at command or by anticipation like the statues of Daedalus and the tripods of Hephaestus”. Reference to the legendary robots devised by these mythological technocrats, the former an artificer who made wings for Icarus and the latter a blacksmith god, testify that the concept of robot, if not the name, was ancient even in Aristotle’s time.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
actor agents algorithm architecture argument artificial intelligence backtracking behavior binding bound called cells channel Chapter chess chopstick color communication compiler complete concurrent considered constraint coroutines data structures database dataflow described developed distributed dynamic environment example execution expert systems functional GDC program goal goto graph guarded definite clause hardware heuristic Horn clauses Huntbach implementation initial input interpreter knowledge lambda calculus layers Lisp logic programming lowest cost machine matching mechanism merge merger meta-interpreter metacircular interpreter metalanguage metalevel metaprogramming multi-agent systems neurons node object object-level object-oriented programming operating system output parallel partial evaluation permanent choice philosopher possible predicate primitive priority problem processors produce programming language Prolog protoNeuron recursive reduce represented robot rules search tree semantics sequential server single Smalltalk solution solving stream synchronization terminate theorem thread true become tuple variables Vertex xyobj