 |
|
|
Item Details
| Title:
|
CHALLENGES FOR ACTION THEORIES
|
| By: |
Michael Thielscher |
| Format: |
Paperback |
| List price:
|
£62.99 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
3540674551 |
| ISBN 13: |
9783540674559 |
| Publisher: |
SPRINGER-VERLAG BERLIN AND HEIDELBERG GMBH & CO. KG |
| Pub. date: |
16 April, 2000 |
| Series: |
Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence 1775 |
| Pages: |
146 |
| Description: |
Offers a solution to the ramification problem and qualification problem in the design of computer systems. Fluent calculus, (a first-order Prolog-like formalism describing actions and change) is utilized. The title is aimed at for researchers and students in artificial intelligence. |
| Synopsis: |
A logic-based approach to the design of computing systems would, undoubtedly, offer many advantages over the imperative paradigm most commonly applied so far for programming and hardware design and, consequently, logic, again and again, has been heralded as the basis for the next generation of computer systems. While logic and formal methods are indeed gaining ground in many areas of computer science and artificial intelligence the expected revolution has not yet happened. In this book the author offers a convincing solution to the ramification problem and qualification problem associated with the frame problem and thus contributes to a satisfactory solution of the core problem and related challenges. Thielscher bases his approach on the fluent calculus, a first-order Prolog-like formalism allowing for the description of actions and change. |
| Illustrations: |
biography |
| Publication: |
Germany |
| Imprint: |
Springer-Verlag Berlin and Heidelberg GmbH & Co. K |
| Returns: |
Returnable |
|
|
|
 |
Ramadan and Eid al-Fitr
A celebratory, inclusive and educational exploration of Ramadan and Eid al-Fitr for both children that celebrate and children who want to understand and appreciate their peers who do.
|
|
|
|
|
|
|
|
|
|
|