PARALLEL AND DISTRIBUTED LOGIC PROGRAMMING
CONTENTS 1 2 2 THEORM PROVING IN THE CLASSICAL LOGIC 1 3 LOGIC PROGRAMMING 1 3 1 DEFINITIONS 1 3 2 EVALUATION OF QUERIES WITH A STACK 1 3 4 INTERPRETATION AND THEIR STABILITY IN A LOGIC PROGRAM 1 4 INTRODUCTION TO PARALLEL ARCHITECTURE 1 4 1 SIMD AND MIMD MACHINES 1 4 2 DATA FLOW ARCHITECTURE 1 6 1 POSSIBLE PARALLELISMS IN A LOGIC PROGRAM 1 7 SCOPE OF PARALLELISM IN LOGIC PROGRAMS USING PETRI NETS 1 8 CONCLUSION EXERCISE REFERENCES 2 PARALLEL AND DISTRIBUTED MODELS FOR LOGIC PROGRAMMING — 2 1 INTRODUCTION 2 2 THE RAP-WAM ARCHITECTURE 2 3 AUTOMATED MAPPING OF LOGIC PROGRAM ONTO A PARALLEL ARCHITECTURE 2 4 PARALLEL AND-OR LOGIC PROGRAMMING LANGUAGE 2 5 KALE’S AND-OR TREE MODEL FOR LOGIC PROGRAMMING 2 6 CAM-BASED ARCHITECTURE FOR A PROLOG MACHINE 2 7 PERFORMANCE ANALYSIS OF PROLOG PROGRAMS ON DIFFERENT MACHINE ARCHITECTURES 2 8 LOGIC PROGRAMMING USING PETRI NETS 2 10 CONCLUSIONS EXERCISES 1 AN INTRODUCTION TO LOGIC PROGRAMMING 1 1 EVOLUTION OF REASONING PARADIGMS IN ARTIFICIAL INTELLIGENCE WITH THE RESOLUTION PRINCIPLE 1 5 1 PETRI NETS A BRIEF REVIEW — A REVIEW 2 9 SCOPE OF THE BOOK 1 3 3 PROLOG — AN OVERVIEW 1 5 PETRI NET AS A DATAFLOW MACHINE 1 2 THE LOGIC OF PROPOSITIONS AND PREDICATES-A BRIEF REVIEW 1 6 PARALLELISM IN LOGIC PROGRAMS — A REVIEW 1 2 1 THE RESOLUTION PRINCIPLE CONTENTS 3 1 INTRODUCTION 3 2 FORMAL DEFINITIONS 3 2 1 PRELIMINARY DEFINITIONS 3 2 3 SLD RESOLUTION 3 3 CONCURRENCY IN RESOLUTION 3 3 1 PRELIMINARY DEFINITIONS 3 4 PETRI NET MODEL FOR CONCURRENT RESOLUTION 3 4 1 EXTENDED PETRI NET 3 4 2 MAPPING A CLAUSE ONTO EXTENDED PETRI NET 3 4 3 MAPPING A FACT ONTO EXTENDED PETRI NET 3 5 CONCURRENT RESOLUTION ON PETRI NETS 3 5 3 PROPERTIES OF THE ALGORITHM 3 6 PERFORMANCE ANALYSIS OF PETRI NET-BASED MODELS 3 6 1 THE SPEED-UP 3 6 2 THE RESOURCE UTILIZATION RATE 3 6 3 RESOURCE UNLIMITED SPEED-UP AND UTILIZATION RATE 3 7 CONCLUSIONS 4 1 INTRODUCTION 4 2 THE MODULAR ARCHITECTURE OF THE OVERALL SYSTEM 4 3 TRANSITION HISTORY FILE 4 4 THE PTVVM 4 4 1 THE FIRST SUB-UNIT OF THE PTVVM 4 4 2 THE SECOND SUB-UNIT OF THE PTVVM 4 4 3 THE THIRD SUB-UNIT OF THE PTVVM 4 5 THE MATCHER 4 6 THE TRANSITION STATUS FILE 4 7 THE FIRST PRE-CONDITION SYNTHESIZER 4 8 THE FIRING CRITERIA TESTING LOGIC 4 9 TIMING ANALYSIS FOR THE PROPOSED ARCHITECTURE 4 10 CONCLUSIONS EXCERCISES 5 PARSING AND TASK ASSIGNMENT ON TO THE PROPOSED PARALLEL ARCHITECTURE 5 1 INTRODUCTION 5 2 PARSING AND SYNTAX ANALYSIS XII 3 5 2 ALGORITHM FOR CONCURRENT RESOLUTION 3 3 2 TYPES OF CONCURRENT RESOLUTION 3 THE PETRI NET MODEL — A NEW APPROACH 3 2 2 PROPERTIES OF SUBSTITUTION SET 4 REALIZATION OF A PARALLEL ARCHITECTURE FOR THE PETRI NET MODEL 3 5 1 ENABLING AND FIRING CONDITION OF A TRANSITION 5 2 1 PARSING A LOGIC PROGRAM USING TREES 5 2 2 PARSING USING DETERMINISTIC FINITE AUTOMATA 5 3 RESOURCE LABELING AND MAPPING 5 3 1 LABELING OF SYSTEM RESOURCES 5 3 2 THE PETRI NET MODEL CONSTRUCTION 5 3 3 MAPPING OF SYSTEM RESOURCES 5 4 CONCLUSIONS REFERCENCES 6 1 INTRODUCTION 6 2 THE DATALOG LANGUAGE 6 3 SOME IMPORTANT FEATURES OF DATALOG LANGUAGE 6 4 REPRESENTATIONAL BENEFIT OF INTEGRITY CONSTRAINTS 6 5 THE LDL SYSTEM ARCHITECTURE 6 5 1 DECLARATIVE FEATURE OF THE LDL 6 5 2 BOTTOM-UP QUERY EVALUATION IN THE LDL 6 5 3 NEGATION BY FAILURE COMPUTATIONAL FEATURE 6 5 4 THE STRATIFICATION FEATURE 6 6 DESIGNING DATABASE MACHINE ARCHITECTURES USING PETRI NET MODELS 6 7 SCOPE OF PETRI NET-BASED MODEL IN DATA MINING 6 8 CONCLUSIONS CONTENTS XIII 6 LOGIC PROGRAMMING IN DATABASE APPLICATIONS IN DATALOG PROGRAMS