close
1.

電子ブック
ＥＢ
1. Automata for Branching and Layered Temporal Structures
Gabriele Puppis, Takeo Kanade
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Word Automata and Time Granularities / 2：
Background Knowledge / 2.1：
Words and Languages / 2.1.1：
Periodicity of Words / 2.1.2：
Word Automata / 2.1.3：
Time Granularities / 2.1.4：
The String-Based and Automaton-Based Approaches / 2.2：
The Granspec Formalism / 2.2.1：
From Granspecs to Single-String Automata / 2.2.2：
Counters and Multiple Transitions / 2.2.3：
The Logical Counterpart of RCSSA / 2.2.4：
Compact and Tractable Representations / 2.3：
Nested Repetitions of Words / 2.3.1：
Algorithms on NCSSA / 2.3.2：
Optimizing Representations / 2.3.3：
Reasoning on Sets of Granularities / 2.4：
Languages of Ultimately Periodic Words / 2.4.1：
Ultimately Periodic Automata / 2.4.2：
Algorithms on UPA / 2.4.3：
Applications to Time Granularity / 2.4.4：
Discussion / 2.5：
Tree Automata and Logics / 3：
Graphs and Trees / 3.1：
Tree Automata / 3.1.2：
Monadic Second-Order Logic / 3.1.3：
The Model Checking Problem / 3.1.4：
The Contraction Method for Tree Automata / 3.2：
Features and Types / 3.2.1：
Types and the Acceptance Problem / 3.2.2：
From Trees to Their Retractions / 3.2.3：
An Example / 3.2.4：
Tree Transformations / 3.3：
Tree Recolorings / 3.3.1：
Tree Substitutions / 3.3.2：
Tree Transducers / 3.3.3：
Inverse Substitutions / 3.3.4：
A Summary / 3.3.5：
The Class of Reducible Trees / 3.4：
Compositional Properties of Types / 3.4.1：
Closure Properties / 3.4.2：
Effectiveness of the Contraction Method / 3.5：
Reducible Trees and the Caucal Hierarchy / 3.5.1：
Two-Way Alternating Tree Automata / 3.5.2：
Morphic Trees / 3.5.3：
Layered Temporal Structures / 3.5.4：
Summary / 3.6：
Technical Proofs / A：
Proofs of Theorem 5 and Theorem 6 / A.l：
Proof of Theorem 8 / A.2：
Proof of Proposition 34 / A.3：
References
Notation
Index
Introduction / 1：
Word Automata and Time Granularities / 2：
Background Knowledge / 2.1：
2.

電子ブック
ＥＢ
2. Automata for Branching and Layered Temporal Structures
Gabriele Puppis, Takeo Kanade
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Word Automata and Time Granularities / 2：
Background Knowledge / 2.1：
Words and Languages / 2.1.1：
Periodicity of Words / 2.1.2：
Word Automata / 2.1.3：
Time Granularities / 2.1.4：
The String-Based and Automaton-Based Approaches / 2.2：
The Granspec Formalism / 2.2.1：
From Granspecs to Single-String Automata / 2.2.2：
Counters and Multiple Transitions / 2.2.3：
The Logical Counterpart of RCSSA / 2.2.4：
Compact and Tractable Representations / 2.3：
Nested Repetitions of Words / 2.3.1：
Algorithms on NCSSA / 2.3.2：
Optimizing Representations / 2.3.3：
Reasoning on Sets of Granularities / 2.4：
Languages of Ultimately Periodic Words / 2.4.1：
Ultimately Periodic Automata / 2.4.2：
Algorithms on UPA / 2.4.3：
Applications to Time Granularity / 2.4.4：
Discussion / 2.5：
Tree Automata and Logics / 3：
Graphs and Trees / 3.1：
Tree Automata / 3.1.2：
Monadic Second-Order Logic / 3.1.3：
The Model Checking Problem / 3.1.4：
The Contraction Method for Tree Automata / 3.2：
Features and Types / 3.2.1：
Types and the Acceptance Problem / 3.2.2：
From Trees to Their Retractions / 3.2.3：
An Example / 3.2.4：
Tree Transformations / 3.3：
Tree Recolorings / 3.3.1：
Tree Substitutions / 3.3.2：
Tree Transducers / 3.3.3：
Inverse Substitutions / 3.3.4：
A Summary / 3.3.5：
The Class of Reducible Trees / 3.4：
Compositional Properties of Types / 3.4.1：
Closure Properties / 3.4.2：
Effectiveness of the Contraction Method / 3.5：
Reducible Trees and the Caucal Hierarchy / 3.5.1：
Two-Way Alternating Tree Automata / 3.5.2：
Morphic Trees / 3.5.3：
Layered Temporal Structures / 3.5.4：
Summary / 3.6：
Technical Proofs / A：
Proofs of Theorem 5 and Theorem 6 / A.l：
Proof of Theorem 8 / A.2：
Proof of Proposition 34 / A.3：
References
Notation
Index
Introduction / 1：
Word Automata and Time Granularities / 2：
Background Knowledge / 2.1：
3.

電子ブック
ＥＢ
3. Sensitivity Analysis for Neural Networks
Daniel S. Yeung, Ian Cloete, Wing W. Y. Ng, Daming Shi
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction to Neural Networks / 1：
Properties of Neural Networks / 1.1：
Neural Network Learning / 1.2：
Supervised Learning / 1.2.1：
Unsupervised Learning / 1.2.2：
Perceptron / 1.3：
Adaline and Least Mean Square Algorithm / 1.4：
Multilayer Perceptron and Backpropagation Algorithm / 1.5：
Output Layer Learning / 1.5.1：
Hidden Layer Learning / 1.5.2：
Radial Basis Function Networks / 1.6：
Support Vector Machines / 1.7：
Principles of Sensitivity Analysis / 2：
Perturbations in Neural Networks / 2.1：
Neural Network Sensitivity Analysis / 2.2：
Fundamental Methods of Sensitivity Analysis / 2.3：
Geometrical Approach / 2.3.1：
Statistical Approach / 2.3.2：
Summary / 2.4：
Hyper-Rectangle Model / 3：
Hyper-Rectangle Model for Input Space of MLP / 3.1：
Sensitivity Measure of MLP / 3.2：
Discussion / 3.3：
Sensitivity Analysis with Parameterized Activation Function / 4：
Parameterized Antisymmetric Squashing Function / 4.1：
Sensitivity Measure / 4.2：
Localized Generalization Error Model / 4.3：
Introduction / 5.1：
The Localized Generalization Error Model / 5.2：
The Q-Neighborhood and Q-Union / 5.2.1：
The Localized Generalization Error Bound / 5.2.2：
Stochastic Sensitivity Measure for RBFNN / 5.2.3：
Characteristics of the Error Bound / 5.2.4：
Comparing Two Classifiers Using the Error Bound / 5.2.5：
Architecture Selection Using the Error Bound / 5.3：
Critical Vector Learning for RBF Networks / 5.3.1：
Related Work / 6.1：
Construction of RBF Networks with Sensitivity Analysis / 6.2：
RBF Classifiers' Sensitivity to the Kernel Function Centers / 6.2.1：
Orthogonal Least Square Transform / 6.2.2：
Critical Vector Selection / 6.2.3：
Sensitivity Analysis of Prior Knowledge / 6.3：
KBANNs / 7.1：
Inductive Bias / 7.2：
Sensitivity Analysis and Measures / 7.3：
Output-Pattern Sensitivity / 7.3.1：
Output-Weight Sensitivity / 7.3.2：
Output-H Sensitivity / 7.3.3：
Euclidean Distance / 7.3.4：
Promoter Recognition / 7.4：
Data and Initial Domain Theory / 7.4.1：
Experimental Methodology / 7.4.2：
Discussion and Conclusion / 7.5：
Applications / 8：
Input Dimension Reduction / 8.1：
Sensitivity Matrix / 8.1.1：
Criteria for Pruning Inputs / 8.1.2：
Network Optimization / 8.2：
Selective Learning / 8.3：
Hardware Robustness / 8.4：
Measure of Nonlinearity / 8.5：
Parameter Tuning for Neocognitron / 8.6：
Receptive Field / 8.6.1：
Selectivity / 8.6.2：
Sensitivity Analysis of the Neocognitron / 8.6.3：
Bibliography
Introduction to Neural Networks / 1：
Properties of Neural Networks / 1.1：
Neural Network Learning / 1.2：
4.

電子ブック
ＥＢ
4. Sensitivity Analysis for Neural Networks
Daniel S. Yeung, Ian Cloete, Wing W. Y. Ng, Daming Shi
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction to Neural Networks / 1：
Properties of Neural Networks / 1.1：
Neural Network Learning / 1.2：
Supervised Learning / 1.2.1：
Unsupervised Learning / 1.2.2：
Perceptron / 1.3：
Adaline and Least Mean Square Algorithm / 1.4：
Multilayer Perceptron and Backpropagation Algorithm / 1.5：
Output Layer Learning / 1.5.1：
Hidden Layer Learning / 1.5.2：
Radial Basis Function Networks / 1.6：
Support Vector Machines / 1.7：
Principles of Sensitivity Analysis / 2：
Perturbations in Neural Networks / 2.1：
Neural Network Sensitivity Analysis / 2.2：
Fundamental Methods of Sensitivity Analysis / 2.3：
Geometrical Approach / 2.3.1：
Statistical Approach / 2.3.2：
Summary / 2.4：
Hyper-Rectangle Model / 3：
Hyper-Rectangle Model for Input Space of MLP / 3.1：
Sensitivity Measure of MLP / 3.2：
Discussion / 3.3：
Sensitivity Analysis with Parameterized Activation Function / 4：
Parameterized Antisymmetric Squashing Function / 4.1：
Sensitivity Measure / 4.2：
Localized Generalization Error Model / 4.3：
Introduction / 5.1：
The Localized Generalization Error Model / 5.2：
The Q-Neighborhood and Q-Union / 5.2.1：
The Localized Generalization Error Bound / 5.2.2：
Stochastic Sensitivity Measure for RBFNN / 5.2.3：
Characteristics of the Error Bound / 5.2.4：
Comparing Two Classifiers Using the Error Bound / 5.2.5：
Architecture Selection Using the Error Bound / 5.3：
Critical Vector Learning for RBF Networks / 5.3.1：
Related Work / 6.1：
Construction of RBF Networks with Sensitivity Analysis / 6.2：
RBF Classifiers' Sensitivity to the Kernel Function Centers / 6.2.1：
Orthogonal Least Square Transform / 6.2.2：
Critical Vector Selection / 6.2.3：
Sensitivity Analysis of Prior Knowledge / 6.3：
KBANNs / 7.1：
Inductive Bias / 7.2：
Sensitivity Analysis and Measures / 7.3：
Output-Pattern Sensitivity / 7.3.1：
Output-Weight Sensitivity / 7.3.2：
Output-H Sensitivity / 7.3.3：
Euclidean Distance / 7.3.4：
Promoter Recognition / 7.4：
Data and Initial Domain Theory / 7.4.1：
Experimental Methodology / 7.4.2：
Discussion and Conclusion / 7.5：
Applications / 8：
Input Dimension Reduction / 8.1：
Sensitivity Matrix / 8.1.1：
Criteria for Pruning Inputs / 8.1.2：
Network Optimization / 8.2：
Selective Learning / 8.3：
Hardware Robustness / 8.4：
Measure of Nonlinearity / 8.5：
Parameter Tuning for Neocognitron / 8.6：
Receptive Field / 8.6.1：
Selectivity / 8.6.2：
Sensitivity Analysis of the Neocognitron / 8.6.3：
Bibliography
Introduction to Neural Networks / 1：
Properties of Neural Networks / 1.1：
Neural Network Learning / 1.2：
5.

電子ブック
ＥＢ
5. Architecture-Based Design of Multi-Agent Systems
Danny Weyns
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Software Architecture and Middleware / 1.1：
Software Architecture / 1.1.1：
Middleware / 1.1.2：
Agent-Oriented Methodologies / 1.2：
Case Study / 1.3：
Overview of the Book / 1.4：
Overview of Architecture-Based Design of Multi-Agent Systems / 2：
General Overview of the Approach / 2.1：
Architectural Design in the Development Life Cycle / 2.1.1：
Steps of Architecture-Based Design of Multi-Agent Systems / 2.1.2：
Functional and Quality Attribute Requirements / 2.2：
Architectural Design / 2.3：
Architectural Patterns / 2.3.1：
ADD Process / 2.3.2：
Middleware Support for Multi-Agent Systems / 2.4：
Documenting Software Architecture / 2.5：
Architectural Views / 2.5.1：
Architectural Description Languages / 2.5.2：
Evaluating Software Architecture / 2.6：
From Software Architecture to Downstream Design and Implementation / 2.7：
Summary / 2.8：
Capturing Expertise in Multi-Agent System Engineering with Architectural Patterns / 3：
Situated Multi-Agent Systems / 3.1：
Single-Agent Systems / 3.1.1：
Multi-Agent Systems / 3.1.2：
Target Domain of the Pattern Language for Situated Multi-Agent Systems / 3.2：
Overview of the Pattern Language / 3.3：
Pattern Template / 3.4：
Virtual Environment / 3.5：
Primary Presentation / 3.5.1：
Architectural Elements / 3.5.2：
Interface Descriptions / 3.5.3：
Design Rationale / 3.5.4：
Situated Agent / 3.6：
Selective Perception / 3.6.1：
Roles and Situated Commitments / 3.7.1：
Free-Flow Trees Extended with Roles and Situated Commitments / 3.8.1：
Protocol-Based Communication / 3.9：
Architectural Design of Multi-Agent Systems / 3.9.1：
Designing and Documenting Multi-Agent System Architectures / 4.1：
Designing and Documenting Architecture in the Development Life Cycle / 4.1.1：
Inputs and Outputs of ADD / 4.1.2：
Overview of the ADD Activities / 4.1.3：
The Domain of Automated Transportation Systems / 4.2：
Business Case / 4.2.2：
System Requirements / 4.2.3：
General Overview of the Design / 4.3：
Challenges at the Outset / 4.3.1：
The System and Its Environment / 4.3.2：
Design Process / 4.3.3：
High-Level Design / 4.3.4：
Architecture Documentation / 4.4：
Introduction to the Architecture Documentation / 4.4.1：
Deployment View / 4.4.2：
Module Uses View / 4.4.3：
Collaborating Components View / 4.4.4：
Middleware for Distributed Multi-Agent Systems / 4.5：
Middleware Support for Distributed, Decentralized Coordination / 5.1：
Middleware in Distributed Software Systems / 5.1.1：
Middleware in Multi-Agent Systems / 5.1.2：
Scope of the Middleware and Requirements / 5.2：
Objectplaces / 5.2.2：
Views / 5.2.3：
Coordination Roles / 5.2.4：
Middleware Architecture / 5.3：
High-Level Module Decomposition / 5.3.1：
Group Formation / 5.3.2：
View Management / 5.3.3：
Role Activation / 5.3.4：
Collision Avoidance in the AGV Transportation System / 5.4：
Collision Avoidance / 5.4.1：
Collision Avoidance Protocol / 5.4.2：
Software Architecture: Communicating Processes for Collision Avoidance / 5.4.3：
Task Assignment / 5.5：
Schedule-Based Task Assignment / 6.1：
FiTA: Field-Based Task Assignment / 6.2：
Coordination Fields / 6.2.1：
Adaptive Task Assignment / 6.2.2：
Dealing With Local Minima / 6.2.3：
DynCNET Protocol / 6.3：
Monitoring the Area of Interest / 6.3.1：
Convergence / 6.3.3：
Synchronization Issues / 6.3.4：
Evaluation / 6.4：
Test Setting / 6.4.1：
Test Results / 6.4.2：
Tradeoff Analysis / 6.4.3：
Evaluation of Multi-Agent System Architectures / 6.5：
Evaluating Multi-Agent System Architectures with ATAM / 7.1：
Architecture Evaluation in the Development Life Cycle / 7.1.1：
Objectives of a Multi-Agent System Architecture Evaluation / 7.1.2：
Overview of the ATAM Activities / 7.1.3：
AGV Transportation System for a Tea Processing Warehouse / 7.2：
Evaluation Process / 7.2.2：
Quality Attribute Workshop / 7.2.3：
Analysis of Architectural Approaches / 7.2.4：
Reflection on ATAM for Evaluating a Multi-Agent System Architecture / 7.3：
ATAM Follow-Up and Demonstrator / 7.4：
Related Approaches / 7.5：
Architectural Approaches and Multi-Agent Systems / 8.1：
Architectural Styles / 8.1.1：
Reference Models and Architectures for Multi-Agent Systems / 8.1.2：
Middleware for Mobile Systems / 8.2：
Work Related to Views / 8.2.1：
Work Related to Coordination Roles / 8.2.2：
Scheduling and Routing of AGV Transportation Systems / 8.3：
AI and Robotics Approaches / 8.3.1：
Multi-Agent System Approaches / 8.3.2：
Conclusions / 9：
Reflection on Architecture-Based Design of Multi-Agent Systems / 9.1：
It Works! / 9.1.1：
Reflection on the Project with Egemin / 9.1.2：
Lessons Learned and Challenges / 9.2：
Dealing with Quality Attributes / 9.2.1：
Designing a Multi-Agent System Architecture / 9.2.2：
Integrating a Multi-Agent System with Its Software Environment / 9.2.3：
Impact of Adopting a Multi-Agent System / 9.2.4：
?-ADL Specification of the Architectural Patterns / A：
Language Constructs / A.1：
Virtual Environment Pattern / A.2：
Situated Agent Pattern / A.3：
Synchronization in the DynCNET Protocol / B：
Synchronization of Abort and Bound Messages / B.1：
Synchronization of Scope Dynamics / B.2：
Overview / C：
Invariant / C.2：
Maintaining the Invariant / C.3：
Glossary
References
Index
Introduction / 1：
Software Architecture and Middleware / 1.1：
Software Architecture / 1.1.1：
6.

電子ブック
ＥＢ
6. Architecture-Based Design of Multi-Agent Systems
Danny Weyns
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Software Architecture and Middleware / 1.1：
Software Architecture / 1.1.1：
Middleware / 1.1.2：
Agent-Oriented Methodologies / 1.2：
Case Study / 1.3：
Overview of the Book / 1.4：
Overview of Architecture-Based Design of Multi-Agent Systems / 2：
General Overview of the Approach / 2.1：
Architectural Design in the Development Life Cycle / 2.1.1：
Steps of Architecture-Based Design of Multi-Agent Systems / 2.1.2：
Functional and Quality Attribute Requirements / 2.2：
Architectural Design / 2.3：
Architectural Patterns / 2.3.1：
ADD Process / 2.3.2：
Middleware Support for Multi-Agent Systems / 2.4：
Documenting Software Architecture / 2.5：
Architectural Views / 2.5.1：
Architectural Description Languages / 2.5.2：
Evaluating Software Architecture / 2.6：
From Software Architecture to Downstream Design and Implementation / 2.7：
Summary / 2.8：
Capturing Expertise in Multi-Agent System Engineering with Architectural Patterns / 3：
Situated Multi-Agent Systems / 3.1：
Single-Agent Systems / 3.1.1：
Multi-Agent Systems / 3.1.2：
Target Domain of the Pattern Language for Situated Multi-Agent Systems / 3.2：
Overview of the Pattern Language / 3.3：
Pattern Template / 3.4：
Virtual Environment / 3.5：
Primary Presentation / 3.5.1：
Architectural Elements / 3.5.2：
Interface Descriptions / 3.5.3：
Design Rationale / 3.5.4：
Situated Agent / 3.6：
Selective Perception / 3.6.1：
Roles and Situated Commitments / 3.7.1：
Free-Flow Trees Extended with Roles and Situated Commitments / 3.8.1：
Protocol-Based Communication / 3.9：
Architectural Design of Multi-Agent Systems / 3.9.1：
Designing and Documenting Multi-Agent System Architectures / 4.1：
Designing and Documenting Architecture in the Development Life Cycle / 4.1.1：
Inputs and Outputs of ADD / 4.1.2：
Overview of the ADD Activities / 4.1.3：
The Domain of Automated Transportation Systems / 4.2：
Business Case / 4.2.2：
System Requirements / 4.2.3：
General Overview of the Design / 4.3：
Challenges at the Outset / 4.3.1：
The System and Its Environment / 4.3.2：
Design Process / 4.3.3：
High-Level Design / 4.3.4：
Architecture Documentation / 4.4：
Introduction to the Architecture Documentation / 4.4.1：
Deployment View / 4.4.2：
Module Uses View / 4.4.3：
Collaborating Components View / 4.4.4：
Middleware for Distributed Multi-Agent Systems / 4.5：
Middleware Support for Distributed, Decentralized Coordination / 5.1：
Middleware in Distributed Software Systems / 5.1.1：
Middleware in Multi-Agent Systems / 5.1.2：
Scope of the Middleware and Requirements / 5.2：
Objectplaces / 5.2.2：
Views / 5.2.3：
Coordination Roles / 5.2.4：
Middleware Architecture / 5.3：
High-Level Module Decomposition / 5.3.1：
Group Formation / 5.3.2：
View Management / 5.3.3：
Role Activation / 5.3.4：
Collision Avoidance in the AGV Transportation System / 5.4：
Collision Avoidance / 5.4.1：
Collision Avoidance Protocol / 5.4.2：
Software Architecture: Communicating Processes for Collision Avoidance / 5.4.3：
Task Assignment / 5.5：
Schedule-Based Task Assignment / 6.1：
FiTA: Field-Based Task Assignment / 6.2：
Coordination Fields / 6.2.1：
Adaptive Task Assignment / 6.2.2：
Dealing With Local Minima / 6.2.3：
DynCNET Protocol / 6.3：
Monitoring the Area of Interest / 6.3.1：
Convergence / 6.3.3：
Synchronization Issues / 6.3.4：
Evaluation / 6.4：
Test Setting / 6.4.1：
Test Results / 6.4.2：
Tradeoff Analysis / 6.4.3：
Evaluation of Multi-Agent System Architectures / 6.5：
Evaluating Multi-Agent System Architectures with ATAM / 7.1：
Architecture Evaluation in the Development Life Cycle / 7.1.1：
Objectives of a Multi-Agent System Architecture Evaluation / 7.1.2：
Overview of the ATAM Activities / 7.1.3：
AGV Transportation System for a Tea Processing Warehouse / 7.2：
Evaluation Process / 7.2.2：
Quality Attribute Workshop / 7.2.3：
Analysis of Architectural Approaches / 7.2.4：
Reflection on ATAM for Evaluating a Multi-Agent System Architecture / 7.3：
ATAM Follow-Up and Demonstrator / 7.4：
Related Approaches / 7.5：
Architectural Approaches and Multi-Agent Systems / 8.1：
Architectural Styles / 8.1.1：
Reference Models and Architectures for Multi-Agent Systems / 8.1.2：
Middleware for Mobile Systems / 8.2：
Work Related to Views / 8.2.1：
Work Related to Coordination Roles / 8.2.2：
Scheduling and Routing of AGV Transportation Systems / 8.3：
AI and Robotics Approaches / 8.3.1：
Multi-Agent System Approaches / 8.3.2：
Conclusions / 9：
Reflection on Architecture-Based Design of Multi-Agent Systems / 9.1：
It Works! / 9.1.1：
Reflection on the Project with Egemin / 9.1.2：
Lessons Learned and Challenges / 9.2：
Dealing with Quality Attributes / 9.2.1：
Designing a Multi-Agent System Architecture / 9.2.2：
Integrating a Multi-Agent System with Its Software Environment / 9.2.3：
Impact of Adopting a Multi-Agent System / 9.2.4：
?-ADL Specification of the Architectural Patterns / A：
Language Constructs / A.1：
Virtual Environment Pattern / A.2：
Situated Agent Pattern / A.3：
Synchronization in the DynCNET Protocol / B：
Synchronization of Abort and Bound Messages / B.1：
Synchronization of Scope Dynamics / B.2：
Overview / C：
Invariant / C.2：
Maintaining the Invariant / C.3：
Glossary
References
Index
Introduction / 1：
Software Architecture and Middleware / 1.1：
Software Architecture / 1.1.1：
7.

電子ブック
ＥＢ
7. Logical Tools for Handling Change in Agent-Based Systems
Dov M. Gabbay, Karl Schlechta
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction and Motivation / 1：
Programme / 1.1：
Short Overview of the Different Logics / 1.2：
Nonmonotonic Logics / 1.2.1：
Theory Revision / 1.2.2：
Theory Update / 1.2.3：
Deontic Logic / 1.2.4：
Counterfactual Conditionals / 1.2.5：
Modal Logic / 1.2.6：
Intuitionistic Logic / 1.2.7：
Inheritance Systems / 1.2.8：
A Summarizing Table for the Semantics / 1.2.9：
A Discussion of Concepts / 1.3：
Basic Semantic Entities, Truth Values, and Operators / 1.3.1：
Algebraic and Structural Semantics / 1.3.2：
Restricted Operators and Relations / 1.3.3：
Copies in Preferential Models / 1.3.4：
Further Remarks on Universality of Representation Proofs / 1.3.5：
$$$ in the Object Language? / 1.3.6：
Various Considerations on Abstract Semantics / 1.3.7：
A Comparison with Reiter Defaults / 1.3.8：
IBRS / 1.4：
Definition and Comments / 1.4.1：
The Power of IBRS / 1.4.2：
Abstract Semantics for IBRS and Its Engineering Realization / 1.4.3：
Basic Definitions and Results / 2：
Algebraic Definitions / 2.1：
Basic Logical Definitions / 2.2：
Basic Definitions and Results for Nonmonotonic Logics / 2.3：
Abstract Semantics by Size / 3：
The First-Order Setting / 3.1：
General Size Semantics / 3.2：
Introduction / 3.2.1：
Main Table / 3.2.2：
Coherent Systems / 3.2.3：
Size and Principal Filter Logic / 3.2.4：
Preferential Structures - Part I / 4：
Remarks on Nonmonotonic Logics and Preferential Semantics / 4.1：
Basic Definitions / 4.1.2：
Preferential Structures Without Domain Conditions / 4.2：
General Discussion / 4.2.1：
Detailed Discussion / 4.2.2：
Preferential Structures - Part II / 5：
Simplifications by Domain Conditions, Logical Properties / 5.1：
Smooth Structures / 5.1.1：
Ranked Structures / 5.1.3：
The Logical Properties with Definability Preservation / 5.1.4：
A-Ranked Structures / 5.2：
Representation Results for A-Ranked Structures / 5.2.1：
Two-Sequent Calculi / 5.3：
Plausibility Logic / 5.3.1：
A Comment on the Work by Arieli and Avron / 5.3.3：
Blurred Observation - Absence of Definability Preservation / 5.4：
General and Smooth Structures Without Definability Preservation / 5.4.1：
The Limit Variant / 5.4.3：
The Algebraic Limit / 5.5.1：
The Logical Limit / 5.5.3：
Higher Preferential Structures / 6：
The General Case / 6.1：
Discussion of the Totally Smooth Case / 6.3：
The Essentially Smooth Case / 6.4：
Translation to Logic / 6.5：
Deontic Logic and Hierarchical Conditionals / 7：
Semantics of Deontic Logic / 7.1：
Introductory Remarks / 7.1.1：
Philosophical Discussion of Obligations / 7.1.2：
Examination of the Various Cases / 7.1.4：
What Is An Obligation? / 7.1.5：
Conclusion / 7.1.6：
A Comment on Work by Aqvist / 7.2：
There Are (At Least) Two Solutions / 7.2.1：
Outline / 7.2.3：
Gm $$$ A Implies G $$$ A (Outline) / 7.2.4：
Hierarchical Conditionals / 7.3：
Formal Modelling and Summary of Results / 7.3.1：
Overview / 7.3.3：
Connections with Other Concepts / 7.3.4：
Formal Results and Representation for Hierarchical Conditionals / 7.3.5：
Theory Update and Theory Revision / 8：
Update / 8.1：
Hidden Dimensions / 8.1.1：
Introduction to Theory Revision / 8.2：
Booth Revision / 8.2.2：
Revision and Independence / 8.2.3：
Preferential Modelling of Defaults / 8.2.4：
Remarks on Independence / 8.2.5：
An Analysis of Defeasible Inheritance Systems / 9：
Terminology / 9.1：
Inheritance and Reactive Diagrams / 9.1.2：
Conceptual Analysis / 9.1.3：
Introduction to Nonmonotonic Inheritance / 9.2：
Basic Discussion / 9.2.1：
Directly Sceptical Split Validity Upward Chaining Off-Path Inheritance / 9.2.2：
Review of Other Approaches and Problems / 9.2.3：
Defeasible Inheritance and Reactive Diagrams / 9.3：
Summary of Our Algorithm / 9.3.1：
Compilation and Memorization / 9.3.2：
Executing the Algorithm / 9.3.4：
Signposts / 9.3.5：
Beyond Inheritance / 9.3.6：
Interpretations / 9.4：
Informal Comparison of Inheritance with the Systems P and R / 9.4.1：
Inheritance as Information Transfer / 9.4.3：
Inheritance as Reasoning with Prototypes / 9.4.4：
Detailed Translation of Inheritance to Modified Systems of Small Sets / 9.5：
Normality / 9.5.1：
Small Sets / 9.5.2：
Bibliography
Index
Introduction and Motivation / 1：
Programme / 1.1：
Short Overview of the Different Logics / 1.2：
8.

電子ブック
ＥＢ
8. Logical Tools for Handling Change in Agent-Based Systems
Dov M. Gabbay, Karl Schlechta
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction and Motivation / 1：
Programme / 1.1：
Short Overview of the Different Logics / 1.2：
Nonmonotonic Logics / 1.2.1：
Theory Revision / 1.2.2：
Theory Update / 1.2.3：
Deontic Logic / 1.2.4：
Counterfactual Conditionals / 1.2.5：
Modal Logic / 1.2.6：
Intuitionistic Logic / 1.2.7：
Inheritance Systems / 1.2.8：
A Summarizing Table for the Semantics / 1.2.9：
A Discussion of Concepts / 1.3：
Basic Semantic Entities, Truth Values, and Operators / 1.3.1：
Algebraic and Structural Semantics / 1.3.2：
Restricted Operators and Relations / 1.3.3：
Copies in Preferential Models / 1.3.4：
Further Remarks on Universality of Representation Proofs / 1.3.5：
$$$ in the Object Language? / 1.3.6：
Various Considerations on Abstract Semantics / 1.3.7：
A Comparison with Reiter Defaults / 1.3.8：
IBRS / 1.4：
Definition and Comments / 1.4.1：
The Power of IBRS / 1.4.2：
Abstract Semantics for IBRS and Its Engineering Realization / 1.4.3：
Basic Definitions and Results / 2：
Algebraic Definitions / 2.1：
Basic Logical Definitions / 2.2：
Basic Definitions and Results for Nonmonotonic Logics / 2.3：
Abstract Semantics by Size / 3：
The First-Order Setting / 3.1：
General Size Semantics / 3.2：
Introduction / 3.2.1：
Main Table / 3.2.2：
Coherent Systems / 3.2.3：
Size and Principal Filter Logic / 3.2.4：
Preferential Structures - Part I / 4：
Remarks on Nonmonotonic Logics and Preferential Semantics / 4.1：
Basic Definitions / 4.1.2：
Preferential Structures Without Domain Conditions / 4.2：
General Discussion / 4.2.1：
Detailed Discussion / 4.2.2：
Preferential Structures - Part II / 5：
Simplifications by Domain Conditions, Logical Properties / 5.1：
Smooth Structures / 5.1.1：
Ranked Structures / 5.1.3：
The Logical Properties with Definability Preservation / 5.1.4：
A-Ranked Structures / 5.2：
Representation Results for A-Ranked Structures / 5.2.1：
Two-Sequent Calculi / 5.3：
Plausibility Logic / 5.3.1：
A Comment on the Work by Arieli and Avron / 5.3.3：
Blurred Observation - Absence of Definability Preservation / 5.4：
General and Smooth Structures Without Definability Preservation / 5.4.1：
The Limit Variant / 5.4.3：
The Algebraic Limit / 5.5.1：
The Logical Limit / 5.5.3：
Higher Preferential Structures / 6：
The General Case / 6.1：
Discussion of the Totally Smooth Case / 6.3：
The Essentially Smooth Case / 6.4：
Translation to Logic / 6.5：
Deontic Logic and Hierarchical Conditionals / 7：
Semantics of Deontic Logic / 7.1：
Introductory Remarks / 7.1.1：
Philosophical Discussion of Obligations / 7.1.2：
Examination of the Various Cases / 7.1.4：
What Is An Obligation? / 7.1.5：
Conclusion / 7.1.6：
A Comment on Work by Aqvist / 7.2：
There Are (At Least) Two Solutions / 7.2.1：
Outline / 7.2.3：
Gm $$$ A Implies G $$$ A (Outline) / 7.2.4：
Hierarchical Conditionals / 7.3：
Formal Modelling and Summary of Results / 7.3.1：
Overview / 7.3.3：
Connections with Other Concepts / 7.3.4：
Formal Results and Representation for Hierarchical Conditionals / 7.3.5：
Theory Update and Theory Revision / 8：
Update / 8.1：
Hidden Dimensions / 8.1.1：
Introduction to Theory Revision / 8.2：
Booth Revision / 8.2.2：
Revision and Independence / 8.2.3：
Preferential Modelling of Defaults / 8.2.4：
Remarks on Independence / 8.2.5：
An Analysis of Defeasible Inheritance Systems / 9：
Terminology / 9.1：
Inheritance and Reactive Diagrams / 9.1.2：
Conceptual Analysis / 9.1.3：
Introduction to Nonmonotonic Inheritance / 9.2：
Basic Discussion / 9.2.1：
Directly Sceptical Split Validity Upward Chaining Off-Path Inheritance / 9.2.2：
Review of Other Approaches and Problems / 9.2.3：
Defeasible Inheritance and Reactive Diagrams / 9.3：
Summary of Our Algorithm / 9.3.1：
Compilation and Memorization / 9.3.2：
Executing the Algorithm / 9.3.4：
Signposts / 9.3.5：
Beyond Inheritance / 9.3.6：
Interpretations / 9.4：
Informal Comparison of Inheritance with the Systems P and R / 9.4.1：
Inheritance as Information Transfer / 9.4.3：
Inheritance as Reasoning with Prototypes / 9.4.4：
Detailed Translation of Inheritance to Modified Systems of Small Sets / 9.5：
Normality / 9.5.1：
Small Sets / 9.5.2：
Bibliography
Index
Introduction and Motivation / 1：
Programme / 1.1：
Short Overview of the Different Logics / 1.2：
9.

電子ブック
ＥＢ
9. Dependency Structures and Lexicalized Grammars
Marco Kuhlmann, Takeo Kanade
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Motivation / 1.1：
Dependency Structures / 1.1.1：
Generative Capacity and Non-projectivity / 1.1.2：
Lexicalized Grammars Induce Dependency Trees / 1.2：
Overview of the Book / 1.3：
Dependency Languages / 1.3.1：
Contributions / 1.3.3：
Preliminaries / 2：
Projective Dependency Structures / 3：
Projectivity / 3.1：
Projectivity in the Sense of Harper and Hays / 3.1.1：
Projectivity in the Sense of Lecerf and Ihm / 3.1.2：
Projectivity in the Sense of Fitialov / 3.1.3：
Related Work / 3.1.4：
Algebraic Framework / 3.2：
Tree Traversal Strategies / 3.2.1：
Traversal of Treelet-Ordered Trees / 3.2.2：
Order Annotations / 3.2.3：
Dependency Algebras / 3.2.4：
Algorithmic Problems / 3.3：
Encoding and Decoding / 3.3.1：
Testing whether a Dependency Structure Is Projective / 3.3.2：
Empirical Evaluation / 3.3.3：
The Projectivity Hypothesis / 3.4.1：
Experimental Setup / 3.4.2：
Results and Discussion / 3.4.3：
Dependency Structures of Bounded Degree / 3.4.4：
The Block-Degree Measure / 4.1：
Blocks and Block-Degree / 4.1.1：
A Hierarchy of Non-projective Dependency Structures / 4.1.2：
Traversal of Block-Ordered Trees / 4.1.3：
Segmented Dependency Structures / 4.2.2：
Dependency Structure Algebras / 4.2.3：
Encoding / 4.3：
Computing the Block-Degree of a Dependency Structure / 4.3.2：
Dependency Structures without Crossings / 4.4：
Weakly Non-projective Dependency Structures / 5.1：
Definition of Weak Non-projectivity / 5.1.1：
Relation to the Block-Degree Measure / 5.1.2：
Algebraic Opaqueness / 5.1.3：
Well-Nested Dependency Structures / 5.1.4：
Definition of Well-Nestedness / 5.2.1：
Non-crossing Partitions / 5.2.2：
Algebraic Characterization / 5.2.3：
Testing whether a Dependency Structure Is Well-Nested / 5.2.4：
Structures and Grammars / 5.2.5：
Context-Free Grammars / 6.1：
Definition / 6.1.1：
String Semantics / 6.1.2：
Linearization Semantics / 6.1.3：
Dependency Semantics / 6.1.4：
Linear Context-Free Rewriting Systems / 6.2：
Non-essential Concatenation Functions / 6.2.1：
Coupled Context-Free Grammars / 6.2.4：
Tree Adjoining Grammar / 6.3.1：
Regular Dependency Languages / 6.4.1：
Regular Sets of Dependency Structures / 7.1：
Algebraic Recognizability / 7.1.1：
Elementary Properties / 7.1.2：
Regular Term Grammars / 7.1.3：
Regular Dependency Grammars / 7.1.4：
Dependency Languages and Lexicalized Grammars / 7.1.5：
Pumping Lemmata / 7.2：
The Pumping Lemma for Regular Term Languages / 7.2.1：
Ogden's Lemma for Regular Term Languages / 7.2.2：
Constant Growth / 7.3：
Constant Growth and Semilinearity / 7.3.1：
Regular Term Languages are Semilinear / 7.3.2：
Generative Capacity and Parsing Complexity / 7.3.3：
Projection of String Languages / 8.1：
Labelled Dependency Structures / 8.1.1：
String-Generating Regular Dependency Grammars / 8.1.2：
String-Generative Capacity / 8.1.3：
String Languages and Structural Properties / 8.2：
Masked Strings / 8.2.1：
Enforcing a Given Block-Degree / 8.2.2：
Enforcing Ill-Nestedness / 8.2.3：
Hierarchies of String Languages / 8.2.4：
Parsing Complexity / 8.2.5：
Membership Problems / 8.3.1：
The Standard Membership Problem / 8.3.2：
The Uniform Membership Problem / 8.3.3：
Recognition of Well-Nested Languages / 8.3.4：
Conclusion / 8.3.5：
Main Contributions / 9.1：
Future Directions / 9.2：
Development of the Formalism / 9.2.1：
Linguistic Relevance / 9.2.2：
Applications to Parsing / 9.2.3：
An Algebraic Perspective on Grammar Formalisms / 9.2.4：
References
Index
Introduction / 1：
Motivation / 1.1：
Dependency Structures / 1.1.1：
10.

電子ブック
ＥＢ
10. Dependency Structures and Lexicalized Grammars
Marco Kuhlmann, Takeo Kanade, Josef Kittler
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Motivation / 1.1：
Dependency Structures / 1.1.1：
Generative Capacity and Non-projectivity / 1.1.2：
Lexicalized Grammars Induce Dependency Trees / 1.2：
Overview of the Book / 1.3：
Dependency Languages / 1.3.1：
Contributions / 1.3.3：
Preliminaries / 2：
Projective Dependency Structures / 3：
Projectivity / 3.1：
Projectivity in the Sense of Harper and Hays / 3.1.1：
Projectivity in the Sense of Lecerf and Ihm / 3.1.2：
Projectivity in the Sense of Fitialov / 3.1.3：
Related Work / 3.1.4：
Algebraic Framework / 3.2：
Tree Traversal Strategies / 3.2.1：
Traversal of Treelet-Ordered Trees / 3.2.2：
Order Annotations / 3.2.3：
Dependency Algebras / 3.2.4：
Algorithmic Problems / 3.3：
Encoding and Decoding / 3.3.1：
Testing whether a Dependency Structure Is Projective / 3.3.2：
Empirical Evaluation / 3.3.3：
The Projectivity Hypothesis / 3.4.1：
Experimental Setup / 3.4.2：
Results and Discussion / 3.4.3：
Dependency Structures of Bounded Degree / 3.4.4：
The Block-Degree Measure / 4.1：
Blocks and Block-Degree / 4.1.1：
A Hierarchy of Non-projective Dependency Structures / 4.1.2：
Traversal of Block-Ordered Trees / 4.1.3：
Segmented Dependency Structures / 4.2.2：
Dependency Structure Algebras / 4.2.3：
Encoding / 4.3：
Computing the Block-Degree of a Dependency Structure / 4.3.2：
Dependency Structures without Crossings / 4.4：
Weakly Non-projective Dependency Structures / 5.1：
Definition of Weak Non-projectivity / 5.1.1：
Relation to the Block-Degree Measure / 5.1.2：
Algebraic Opaqueness / 5.1.3：
Well-Nested Dependency Structures / 5.1.4：
Definition of Well-Nestedness / 5.2.1：
Non-crossing Partitions / 5.2.2：
Algebraic Characterization / 5.2.3：
Testing whether a Dependency Structure Is Well-Nested / 5.2.4：
Structures and Grammars / 5.2.5：
Context-Free Grammars / 6.1：
Definition / 6.1.1：
String Semantics / 6.1.2：
Linearization Semantics / 6.1.3：
Dependency Semantics / 6.1.4：
Linear Context-Free Rewriting Systems / 6.2：
Non-essential Concatenation Functions / 6.2.1：
Coupled Context-Free Grammars / 6.2.4：
Tree Adjoining Grammar / 6.3.1：
Regular Dependency Languages / 6.4.1：
Regular Sets of Dependency Structures / 7.1：
Algebraic Recognizability / 7.1.1：
Elementary Properties / 7.1.2：
Regular Term Grammars / 7.1.3：
Regular Dependency Grammars / 7.1.4：
Dependency Languages and Lexicalized Grammars / 7.1.5：
Pumping Lemmata / 7.2：
The Pumping Lemma for Regular Term Languages / 7.2.1：
Ogden's Lemma for Regular Term Languages / 7.2.2：
Constant Growth / 7.3：
Constant Growth and Semilinearity / 7.3.1：
Regular Term Languages are Semilinear / 7.3.2：
Generative Capacity and Parsing Complexity / 7.3.3：
Projection of String Languages / 8.1：
Labelled Dependency Structures / 8.1.1：
String-Generating Regular Dependency Grammars / 8.1.2：
String-Generative Capacity / 8.1.3：
String Languages and Structural Properties / 8.2：
Masked Strings / 8.2.1：
Enforcing a Given Block-Degree / 8.2.2：
Enforcing Ill-Nestedness / 8.2.3：
Hierarchies of String Languages / 8.2.4：
Parsing Complexity / 8.2.5：
Membership Problems / 8.3.1：
The Standard Membership Problem / 8.3.2：
The Uniform Membership Problem / 8.3.3：
Recognition of Well-Nested Languages / 8.3.4：
Conclusion / 8.3.5：
Main Contributions / 9.1：
Future Directions / 9.2：
Development of the Formalism / 9.2.1：
Linguistic Relevance / 9.2.2：
Applications to Parsing / 9.2.3：
An Algebraic Perspective on Grammar Formalisms / 9.2.4：
References
Index
Introduction / 1：
Motivation / 1.1：
Dependency Structures / 1.1.1：
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼