Parallel and Distributed Logic Programming: Towards the Design of a Framework fo

Description: Parallel and Distributed Logic Programming by Alakananda Bhattacharya, Amit Konar, Ajit K. Mandal Foundation of logic historically dates back to the times of Aristotle, who pioneered the concept of truth/falsehood paradigm in reasoning. An inspection of a large number of logic programs, however, reveals that more than one pair of program clauses can be resolved simultaneously without violating the syntax and the semantics of logic programming. FORMAT Paperback LANGUAGE English CONDITION Brand New Publisher Description Foundation of logic historically dates back to the times of Aristotle, who pioneered the concept of truth/falsehood paradigm in reasoning. Mathematical logic of propositions and predicates, which are based on the classical models of Aristotle, underwent a dramatic evolution during the last 50 years for its increasing applications in automated reasoning on digital computers. The subject of Logic Programming is concerned with automated reasoning with facts and knowledge to answer a users query following the syntax and semantics of the logic of propositions/predicates. The credit of automated reasoning by logic programs goes to Professor Robinson for his well-known resolution theorem that provides a general scheme to select two program clauses for deriving an inference. Until now Robinsons theorem is being used in PROLOG/DATALOG compilers to automatically build a Select Linear Definite (SLD) clause based resolution tree for answering a users query. The SLD-tree based scheme for reasoning undoubtedly opened a new era in logic programming for its simplicity in implementation in the compilers. In fact, SLD-tree construction suffices the need for users with a limited set of program clauses. But with increase in the number of program clauses, the execution time of the program also increases linearly by the SLD-tree based approach. An inspection of a large number of logic programs, however, reveals that more than one pair of program clauses can be resolved simultaneously without violating the syntax and the semantics of logic programming. This book employs this principle to speed up the execution time of logic programs. Notes Recent advances in Parallel and Distributed Logic Programming Back Cover The book Parallel and Distributed Logic Programming provides a clear introduction to parallel and distributed approach to logic programming. It examines the existing models of distributed logic programming, analyses the pros and cons of these models, and proposes an alternative framework for distributed logic programming using extended Petri nets. The hardwired realization of the Petri net based framework is presented in detail. Principles of mapping of a logic program on to the proposed framework are also outlined. Finally, the book attempts to explore the scope of Petri net models in designing deductive database machines of the next generation. Table of Contents An Introduction to Logic Programming.- Parallel and Distributed Models for Logic Programming — A Review.- The Petri Net Model — A New Approach.- Realization of a Parallel Architecture for the Petri Net Model.- Parsing and Task Assignment on to the Proposed Parallel Architecture.- Logic Programming in Database Applications. Long Description Foundation of logic historically dates back to the times of Aristotle, who pioneered the concept of truth/falsehood paradigm in reasoning. Mathematical logic of propositions and predicates, which are based on the classical models of Aristotle, underwent a dramatic evolution during the last 50 years for its increasing applications in automated reasoning on digital computers. The subject of Logic Programming is concerned with automated reasoning with facts and knowledge to answer a users query following the syntax and semantics of the logic of propositions/predicates. The credit of automated reasoning by logic programs goes to Professor Robinson for his well-known resolution theorem that provides a general scheme to select two program clauses for deriving an inference. Until now Robinsons theorem is being used in PROLOG/DATALOG compilers to automatically build a Select Linear Definite (SLD) clause based resolution tree for answering a users query. The SLD-tree based scheme for reasoning undoubtedly opened a new era in logic programming for its simplicity in implementation in the compilers. In fact, SLD-tree construction suffices the need for users with a limited set of program clauses. But with increase in the number of program clauses, the execution time of the program also increases linearly by the SLD-tree based approach. An inspection of a large number of logic programs, however, reveals that more than one pair of program clauses can be resolved simultaneously without violating the syntax and the semantics of logic programming. This book employs this principle to speed up the execution time of logic programs. Feature Recent advances in Parallel and Distributed Logic Programming Details ISBN3642070086 Author Ajit K. Mandal Publisher Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Series Studies in Computational Intelligence Year 2010 ISBN-10 3642070086 ISBN-13 9783642070082 Format Paperback Publication Date 2010-11-19 Imprint Springer-Verlag Berlin and Heidelberg GmbH & Co. K Place of Publication Berlin Country of Publication Germany DEWEY 005.1151 Edition 1st Short Title PARALLEL & DISTRIBUTED LOGIC P Language English Media Book Series Number 24 Subtitle Towards the Design of a Framework for the Next Generation Database Machines Pages 291 Edition Description Softcover reprint of hardcover 1st ed. 2006 Alternative 9783540334583 Audience Professional & Vocational Illustrations XIII, 291 p. We've got this At The Nile, if you're looking for it, we've got it. With fast shipping, low prices, friendly service and well over a million items - you're bound to find what you want, at a price you'll love! TheNile_Item_ID:96270042;

Price: 344.56 AUD

Location: Melbourne

End Time: 2024-12-05T12:34:39.000Z

Shipping Cost: 9.98 AUD