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. 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：
4.

電子ブック
ＥＢ
4. 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：
5.

電子ブック
ＥＢ
5. OMDoc ? An Open Markup Format for Mathematical Documents [version 1.2]
Michael Kohlhase, Takeo Kanade
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2006
所蔵情報: loading…
目次情報: 続きを見る
Setting the Stage for Open Mathematical Documents / Part I：
Document Markup for the Web / 1：
Structure vest. Appearance in Markup / 1.1：
Markup for the World Wide Web / 1.2：
XML, the eXtensible Markup Language / 1.3：
Markup for Mathematical Knowledge / 2：
Mathematical Objects and Formulae / 2.1：
Mathematical Texts and Statements / 2.2：
Large-Scale Structure and Context in Mathematics / 2.3：
Open Mathematical Documents / 3：
A Brief History of the OMDoc Format / 3.1：
Three Levels of Markup / 3.2：
Situating the OMDoc Format / 3.3：
The Future: An Active Web of (Mathematical) Knowledge / 3.4：
An OMDoc Primer / Part II：
Textbooks and Articles / 4：
Minimal OMDoc Markup / 4.1：
Structure and Statements / 4.2：
Marking up the Formulae / 4.3：
Full Formalization / 4.4：
OpenMath Content Dictionaries / 5：
Structured and Parametrized Theories / 6：
A Development Graph for Elementary Algebra / 7：
Courseware and the Narrative/Content Distinction / 8：
A Knowledge-Centered View / 8.1：
A Narrative-Structured View / 8.2：
Choreographing Narrative and Content OMDoc / 8.3：
Summary / 8.4：
Communication Between Systems / 9：
The OMDoc Document Format / Part III：
OMDoc as a Modular Format / 10：
The OMDoc Namespaces / 10.1：
Common Attributes in OMDoc / 10.2：
Document Infrastructure / 11：
The Document Root / 11.1：
Metadata / 11.2：
Document Comments / 11.3：
Document Structure / 11.4：
Sharing Document Parts / 11.5：
The Dublin Core Elements (Module DC) / 12：
Roles in Dublin Core Elements / 12.2：
Managing Rights / 12.3：
Inheritance of Metadata / 12.4：
Mathematical Objects / 13：
OpenMath / 13.1：
Content MathML / 13.2：
Representing Types in Content-MathML and OpenMath / 13.3：
Semantics of Variables / 13.4：
Legacy Representation for Migration / 13.5：
Mathematical Text / 14：
Multilingual Mathematical Vernacular / 14.1：
Formal Mathematical Properties / 14.2：
Text Fragments and Their Rhetoric/Mathematical Roles / 14.3：
Phrase-Level Markup of Mathematical Vernacular / 14.4：
Technical Terms / 14.5：
Rich Text Structure / 14.6：
Mathematical Statements / 15：
Types of Statements in Mathematics / 15.1：
Theory-Constitutive Statements in OMDoc / 15.2：
The Unassuming Rest / 15.3：
Mathematical Examples in OMDoc / 15.4：
Inline Statements / 15.5：
Theories as Structured Contexts / 15.6：
Abstract Data Types / 16：
Representing Proofs / 17：
Proof Structure / 17.1：
Proof Step Justifications / 17.2：
Scoping and Context in a Proof / 17.3：
Formal Proofs as Mathematical Objects / 17.4：
Complex Theories / 18：
Inheritance via Translations / 18.1：
Postulated Theory Inclusions / 18.2：
Local/Required Theory Inclusions / 18.3：
Induced Assertions / 18.4：
Development Graphs / 18.5：
Notation and Presentation / 19：
Styling OMDoc Elements / 19.1：
A Restricted Style Language / 19.2：
Notation of Symbols / 19.3：
Presenting Bound Variables / 19.4：
Auxiliary Elements / 20：
Non-XML Data and Program Code in OMDoc / 20.1：
Applets and External Objects in OMDoc / 20.2：
Exercises / 21：
Document Models for OMDoc / 22：
XML Document Models / 22.1：
The OMDoc Document Model / 22.2：
OMDoc Sub-Languages / 22.3：
OMDoc Applications, Tools, and Projects / Part IV：
OMDoc Resources / 23：
The OMDoc Web Site, Wiki, and Mailing List / 23.1：
The OMDoc Distribution / 23.2：
The OMDoc Bug Tracker / 23.3：
An XML Catalog for OMDoc / 23.4：
External Resources / 23.5：
Validating OMDoc Documents / 24：
Validation with Document Type Definitions / 24.1：
Validation with RelaxNG Schemata / 24.2：
Validation with XML Schema / 24.3：
Transforming OMDoc / 25：
Extracting and Linking XSLT Templates / 25.1：
Interfaces for Systems / 25.2：
Presenting OMDoc to Humans / 25.3：
Applications and Projects / 26：
Introduction / 26.1：
QMath Parser / 26.2：
Sentido Integrated Environment / 26.3：
MBase / 26.4：
A Search Engine for Mathematical Formulae / 26.5：
Semantic Interrelation and Change Management / 26.6：
MathDox / 26.7：
ActiveMath / 26.8：
Authoring Tools for ActiveMath / 26.9：
SWiM - An OMDoc-Based Semantic Wiki / 26.10：
Induction Challenge Problems / 26.11：
Maya / 26.12：
Hets / 26.13：
CPoint / 26.14：
Stex: A Latex-Based Workflow for OMDoc / 26.15：
An Emacs Mode for Editing OMDoc Documents / 26.16：
Converting Mathematica Notebooks to OMDoc / 26.17：
Standardizing Context in System Interoperability / 26.18：
Proof Assistants in Scientific Editors / 26.19：
VeriFun / 26.20：
Appendix / Part V：
Changes to the Specification / A：
Changes from 1.1 to 1.2 / A.1：
Changes from 1.0 to 1.1 / A.2：
Quick-Reference / B：
Table of Attributes / C：
The RelaxNG Schema for OMDoc / D：
The Sub-language Drivers / D.1：
Common Attributes / D.2：
Module MOBJ: Mathematical Objects and Text / D.3：
Module MTXT: Mathematical Text / D.4：
Module DOC: Document Infrastructure / D.5：
Module DC: Dublin Core Metadata / D.6：
Module ST: Mathematical Statements / D.7：
Module ADT: Abstract Data Types / D.8：
Module PF: Proofs and Proof objects / D.9：
Module CTH: Complex Theories / D.10：
Module RT: Rich Text Structure / D.11：
Module EXT: Applets and Non-XML Data / D.12：
Module PRES: Adding Presentation Information / D.13：
Module QUIZ: Infrastructure for Assessments / D.14：
The RelaxNG Schemata for Mathematical Objects / E：
The RelaxNG Schema for OpenMath / E.1：
The RelaxNG Schema for MathML / E.2：
Bibliography
Index
Setting the Stage for Open Mathematical Documents / Part I：
Document Markup for the Web / 1：
Structure vest. Appearance in Markup / 1.1：
6.

電子ブック
ＥＢ
6. OMDoc – An Open Markup Format for Mathematical Documents [version 1.2]
Michael Kohlhase, Takeo Kanade, Josef Kittler
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2006
所蔵情報: loading…
目次情報: 続きを見る
Setting the Stage for Open Mathematical Documents / Part I：
Document Markup for the Web / 1：
Structure vest. Appearance in Markup / 1.1：
Markup for the World Wide Web / 1.2：
XML, the eXtensible Markup Language / 1.3：
Markup for Mathematical Knowledge / 2：
Mathematical Objects and Formulae / 2.1：
Mathematical Texts and Statements / 2.2：
Large-Scale Structure and Context in Mathematics / 2.3：
Open Mathematical Documents / 3：
A Brief History of the OMDoc Format / 3.1：
Three Levels of Markup / 3.2：
Situating the OMDoc Format / 3.3：
The Future: An Active Web of (Mathematical) Knowledge / 3.4：
An OMDoc Primer / Part II：
Textbooks and Articles / 4：
Minimal OMDoc Markup / 4.1：
Structure and Statements / 4.2：
Marking up the Formulae / 4.3：
Full Formalization / 4.4：
OpenMath Content Dictionaries / 5：
Structured and Parametrized Theories / 6：
A Development Graph for Elementary Algebra / 7：
Courseware and the Narrative/Content Distinction / 8：
A Knowledge-Centered View / 8.1：
A Narrative-Structured View / 8.2：
Choreographing Narrative and Content OMDoc / 8.3：
Summary / 8.4：
Communication Between Systems / 9：
The OMDoc Document Format / Part III：
OMDoc as a Modular Format / 10：
The OMDoc Namespaces / 10.1：
Common Attributes in OMDoc / 10.2：
Document Infrastructure / 11：
The Document Root / 11.1：
Metadata / 11.2：
Document Comments / 11.3：
Document Structure / 11.4：
Sharing Document Parts / 11.5：
The Dublin Core Elements (Module DC) / 12：
Roles in Dublin Core Elements / 12.2：
Managing Rights / 12.3：
Inheritance of Metadata / 12.4：
Mathematical Objects / 13：
OpenMath / 13.1：
Content MathML / 13.2：
Representing Types in Content-MathML and OpenMath / 13.3：
Semantics of Variables / 13.4：
Legacy Representation for Migration / 13.5：
Mathematical Text / 14：
Multilingual Mathematical Vernacular / 14.1：
Formal Mathematical Properties / 14.2：
Text Fragments and Their Rhetoric/Mathematical Roles / 14.3：
Phrase-Level Markup of Mathematical Vernacular / 14.4：
Technical Terms / 14.5：
Rich Text Structure / 14.6：
Mathematical Statements / 15：
Types of Statements in Mathematics / 15.1：
Theory-Constitutive Statements in OMDoc / 15.2：
The Unassuming Rest / 15.3：
Mathematical Examples in OMDoc / 15.4：
Inline Statements / 15.5：
Theories as Structured Contexts / 15.6：
Abstract Data Types / 16：
Representing Proofs / 17：
Proof Structure / 17.1：
Proof Step Justifications / 17.2：
Scoping and Context in a Proof / 17.3：
Formal Proofs as Mathematical Objects / 17.4：
Complex Theories / 18：
Inheritance via Translations / 18.1：
Postulated Theory Inclusions / 18.2：
Local/Required Theory Inclusions / 18.3：
Induced Assertions / 18.4：
Development Graphs / 18.5：
Notation and Presentation / 19：
Styling OMDoc Elements / 19.1：
A Restricted Style Language / 19.2：
Notation of Symbols / 19.3：
Presenting Bound Variables / 19.4：
Auxiliary Elements / 20：
Non-XML Data and Program Code in OMDoc / 20.1：
Applets and External Objects in OMDoc / 20.2：
Exercises / 21：
Document Models for OMDoc / 22：
XML Document Models / 22.1：
The OMDoc Document Model / 22.2：
OMDoc Sub-Languages / 22.3：
OMDoc Applications, Tools, and Projects / Part IV：
OMDoc Resources / 23：
The OMDoc Web Site, Wiki, and Mailing List / 23.1：
The OMDoc Distribution / 23.2：
The OMDoc Bug Tracker / 23.3：
An XML Catalog for OMDoc / 23.4：
External Resources / 23.5：
Validating OMDoc Documents / 24：
Validation with Document Type Definitions / 24.1：
Validation with RelaxNG Schemata / 24.2：
Validation with XML Schema / 24.3：
Transforming OMDoc / 25：
Extracting and Linking XSLT Templates / 25.1：
Interfaces for Systems / 25.2：
Presenting OMDoc to Humans / 25.3：
Applications and Projects / 26：
Introduction / 26.1：
QMath Parser / 26.2：
Sentido Integrated Environment / 26.3：
MBase / 26.4：
A Search Engine for Mathematical Formulae / 26.5：
Semantic Interrelation and Change Management / 26.6：
MathDox / 26.7：
ActiveMath / 26.8：
Authoring Tools for ActiveMath / 26.9：
SWiM - An OMDoc-Based Semantic Wiki / 26.10：
Induction Challenge Problems / 26.11：
Maya / 26.12：
Hets / 26.13：
CPoint / 26.14：
Stex: A Latex-Based Workflow for OMDoc / 26.15：
An Emacs Mode for Editing OMDoc Documents / 26.16：
Converting Mathematica Notebooks to OMDoc / 26.17：
Standardizing Context in System Interoperability / 26.18：
Proof Assistants in Scientific Editors / 26.19：
VeriFun / 26.20：
Appendix / Part V：
Changes to the Specification / A：
Changes from 1.1 to 1.2 / A.1：
Changes from 1.0 to 1.1 / A.2：
Quick-Reference / B：
Table of Attributes / C：
The RelaxNG Schema for OMDoc / D：
The Sub-language Drivers / D.1：
Common Attributes / D.2：
Module MOBJ: Mathematical Objects and Text / D.3：
Module MTXT: Mathematical Text / D.4：
Module DOC: Document Infrastructure / D.5：
Module DC: Dublin Core Metadata / D.6：
Module ST: Mathematical Statements / D.7：
Module ADT: Abstract Data Types / D.8：
Module PF: Proofs and Proof objects / D.9：
Module CTH: Complex Theories / D.10：
Module RT: Rich Text Structure / D.11：
Module EXT: Applets and Non-XML Data / D.12：
Module PRES: Adding Presentation Information / D.13：
Module QUIZ: Infrastructure for Assessments / D.14：
The RelaxNG Schemata for Mathematical Objects / E：
The RelaxNG Schema for OpenMath / E.1：
The RelaxNG Schema for MathML / E.2：
Bibliography
Index
Setting the Stage for Open Mathematical Documents / Part I：
Document Markup for the Web / 1：
Structure vest. Appearance in Markup / 1.1：
7.

電子ブック
ＥＢ
7. Agents and Peer-to-Peer Computing
AP2PC 2004, Karl Aberer, Sonia Bergamaschi, Takeo Kanade, Gianluca Moro
出版情報: Springer eBooks Computer Science , Springer Berlin / Heidelberg, 2005
所蔵情報: loading…
8.

電子ブック
ＥＢ
8. Agents and Peer-to-Peer Computing
AP2PC 2004, Karl Aberer, Sonia Bergamaschi, Takeo Kanade, Gianluca Moro
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin / Heidelberg, 2005
所蔵情報: loading…
9.

電子ブック
ＥＢ
9. Intelligent Technologies for Interactive Entertainment
INTETAIN 2005, Takeo Kanade, Mark T. Maybury, Oliviero Stock, Wolfgang Wahlster
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin / Heidelberg, 2005
所蔵情報: loading…
10.

電子ブック
ＥＢ
10. Declarative Agent Languages and Technologies VIII
Andrea Omicini, Takeo Kanade, Sebastian Sardina, Wamberto Vasconcelos
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2011
所蔵情報: loading…
目次情報: 続きを見る
BDI Rational Agents
Operational Behaviour for Executing, Suspending, and Aborting Goals in BDI Agent Systems / John Thangarajah ; James Harland ; David Morley ; Neil Yorke-Smith
BDI Agents with Objectives and Preferences / Aniruddha Dasgupta ; Aditya K. Ghose
Communication, Coordination and Negotiation
Query-Driven Coordination of Multiple Answer Sets / Gauvain Bourgne ; Katsumi Inoue
Commitment-Based Protocols with Behavioral Rules and Correctness Properties of MAS / Matteo Baldoni ; Cristina Baroglio ; Elisa Marengo
A Deduction System for Meaning Negotiation / Elisa Burato ; Matteo Cristani ; Luca Viganò
Social Aspects and Control Systems
Declarative Abstractions for Agent Based Hybrid Control Systems / Louise A. Dennis ; Michael Fisher ; Nicholas K. Lincoln ; Alexei Lisitsa ; Sandor M. Veres
Executing Specifications of Social Reasoning Agents / Iain Wallace ; Michael Rovatsos
Invited Papers
Logic of Information Flow on Communication Channels / Yanjing Wang ; Floor Sietsma ; Jan van Eijck
Distributed Abductive Reasoning with Constraints / Jiefei Ma ; Krysia Broda ; Alessandra Russo ; Emil Lupu
Understanding Permissions through Graphical Norms / Nir Oren ; Madalina Croitoru ; Simon Miles ; Michael Luck
Symbolic Model Checking Commitment Protocols Using Reduction / Mohamed El-Menshawy ; Jamal Bentahar ; Rachida Dssouli
Author Index
BDI Rational Agents
Operational Behaviour for Executing, Suspending, and Aborting Goals in BDI Agent Systems / John Thangarajah ; James Harland ; David Morley ; Neil Yorke-Smith
BDI Agents with Objectives and Preferences / Aniruddha Dasgupta ; Aditya K. Ghose
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼