1 (p1): 1 Introduction 1 (p2): 1.1 Modeling and Solving 1 (p3): 1.1.1 Programming Framework and Algorithm 3 (p4): 1.1.2 Formal Grammar and Parser 6 (p5): 1.2 The NCL Language 6 (p6): 1.2.1 Natural Modeling in Mathematical Logic 7 (p7): 1.2.2 Cooperative Solving 10 (p8): 1.2.3 Comparison with Some Other Systems 11 (p9): 1.3 The POEM Platform 11 (p10): 1.3.1 Development Toolkit 11 (p11): 1.3.2 Component and Server 12 (p12): References 15 (p13): 2 Data Types and Lexical Conventions 15 (p14): 2.1 Data Types 15 (p15): 2.1.1 Generality 15 (p16): 2.1.2 Set 15 (p17): 2.1.3 Date/Time 16 (p18): 2.1.4 Numeric 17 (p19): 2.2 Lexical Tokens 17 (p20): 2.2.1 Characters 18 (p21): 2.2.2 Identifiers 18 (p22): 2.2.3 Predefined Identifiers 18 (p23): 2.2.4 Constants 19 (p24): 2.2.5 Non-Instantiated Values 20 (p25): 2.2.6 Comments 21 (p26): 2.3 Mathematical Notations 21 (p27): 2.3.1 Mathematical Symbols 23 (p28): 2.3.2 Predefined Functions 26 (p29): 2.3.3 Delimiters of TeX 27 (p30): References 29 (p31): 3 Grammar and Semantics 29 (p32): 3.1 Context-Free Rules 29 (p33): 3.1.1 Overall Structure 31 (p34): 3.1.2 Expression 44 (p35): 3.1.3 Constraint 47 (p36): 3.1.4 Declaration 49 (p37): 3.1.5 Declarative Control 53 (p38): 3.1.6 Temporal Control 65 (p39): 3.1.7 Search and Optimization 68 (p40): 3.2 Context-Sensitivity of NCL 68 (p41): 3.2.1 Constant 69 (p42): 3.2.2 Variable 71 (p43): 3.2.3 Function 73 (p44): 3.2.4 Sub-Model 74 (p45): References 75 (p46): 4 Tutorial Programs 75 (p47): 4.1 Getting Started 75 (p48): 4.1.1 Input and Output 76 (p49): 4.1.2 Default Value 77 (p50): 4.1.3 Data Buffer 78 (p51): 4.2 Boolean Logic 79 (p52): 4.3 Numerical Reasoning 79 (p53): 4.3.1 Integer Equation 79 (p54): 4.3.2 Infinity 80 (p55): 4.4 Date/Time 82 (p56): 4.5 String 82 (p57): 4.5.1...

zlibzh/no-category/周建阳著, Jianyang Zhou/自然约束语言 英文版_46541854.pdf

The NCL Natural Constraint Language

Spektrum Akademischer Verlag. in Springer-Verlag GmbH

Springer Berlin Heidelberg : Imprint : Springer

Steinkopff. in Springer-Verlag GmbH

Springer London, Limited

Science Press Springer

Springer Nature

China, People's Republic, China

Springer Nature, Beijing, 2012

Beijing, Berlin, 2012

2012, 2012-12-08

Germany, Germany

Berlin, 2011

1, 20121209

Bookmarks: p1 (p1): 1 Introduction
p2 (p1): 1.1 Modeling and Solving
p3 (p1): 1.1.1 Programming Framework and Algorithm
p4 (p3): 1.1.2 Formal Grammar and Parser
p5 (p6): 1.2 The NCL Language
p6 (p6): 1.2.1 Natural Modeling in Mathematical Logic
p7 (p7): 1.2.2 Cooperative Solving
p8 (p10): 1.2.3 Comparison with Some Other Systems
p9 (p11): 1.3 The POEM Platform
p10 (p11): 1.3.1 Development Toolkit
p11 (p11): 1.3.2 Component and Server
p12 (p12): References
p13 (p15): 2 Data Types and Lexical Conventions
p14 (p15): 2.1 Data Types
p15 (p15): 2.1.1 Generality
p16 (p15): 2.1.2 Set
p17 (p15): 2.1.3 Date/Time
p18 (p16): 2.1.4 Numeric
p19 (p17): 2.2 Lexical Tokens
p20 (p17): 2.2.1 Characters
p21 (p18): 2.2.2 Identifiers
p22 (p18): 2.2.3 Predefined Identifiers
p23 (p18): 2.2.4 Constants
p24 (p19): 2.2.5 Non-Instantiated Values
p25 (p20): 2.2.6 Comments
p26 (p21): 2.3 Mathematical Notations
p27 (p21): 2.3.1 Mathematical Symbols
p28 (p23): 2.3.2 Predefined Functions
p29 (p26): 2.3.3 Delimiters of TeX
p30 (p27): References
p31 (p29): 3 Grammar and Semantics
p32 (p29): 3.1 Context-Free Rules
p33 (p29): 3.1.1 Overall Structure
p34 (p31): 3.1.2 Expression
p35 (p44): 3.1.3 Constraint
p36 (p47): 3.1.4 Declaration
p37 (p49): 3.1.5 Declarative Control
p38 (p53): 3.1.6 Temporal Control
p39 (p65): 3.1.7 Search and Optimization
p40 (p68): 3.2 Context-Sensitivity of NCL
p41 (p68): 3.2.1 Constant
p42 (p69): 3.2.2 Variable
p43 (p71): 3.2.3 Function
p44 (p73): 3.2.4 Sub-Model
p45 (p74): References
p46 (p75): 4 Tutorial Programs
p47 (p75): 4.1 Getting Started
p48 (p75): 4.1.1 Input and Output
p49 (p76): 4.1.2 Default Value
p50 (p77): 4.1.3 Data Buffer
p51 (p78): 4.2 Boolean Logic
p52 (p79): 4.3 Numerical Reasoning
p53 (p79): 4.3.1 Integer Equation
p54 (p79): 4.3.2 Infinity
p55 (p80): 4.4 Date/Time
p56 (p82): 4.5 String
p57 (p82): 4.5.1 String Input
p58 (p82): 4.5.2 Concatenation
p59 (p84): 4.6 Referencing
p60 (p84): 4.6.1 Reference in a Subscript
p61 (p87): 4.6.2 Referenced Operator
p62 (p89): 4.6.3 Subscript Leak
p63 (p90): 4.7 Set Reasoning
p64 (p90): 4.7.1 A General Example
p65 (p90): 4.7.2 Attributes of a Set
p66 (p91): 4.7.3 Piecewise Intervals from a Set
p67 (p91): 4.8 Special Variable
p68 (p91): 4.8.1 Anonymous Variable
p69 (p92): 4.8.2 System Variable
p70 (p93): 4.9 Predefined Function
p71 (p93): 4.9.1 Float Function
p72 (p94): 4.9.2 Aggregate Function
p73 (p97): 4.9.3 Transformation
p74 (p95): 4.9.4 Substring
p75 (p97): 4.9.5 Elements of a Set
p76 (p98): 4.9.6 Date/Time Attribute
p77 (p101): 4.9.7 Extraction
p78 (p103): 4.9.8 Assignment
p79 (p103): 4.10 User-Defined Function
p80 (p103): 4.10.1 Cotangent
p81 (p104): 4.10.2 Global Variable in a Function
p82 (p104): 4.10.3 Query and Objective in a Function
p83 (p105): 4.10.4 Predicate
p84 (p106): 4.10.5 Recursive Function
p85 (p107): 4.10.6 Termination of a Recursion
p86 (p107): 4.10.7 Tree
p87 (p108): 4.11 Selection Statement
p88 (p108): 4.11.1 Switch
p89 (p110): 4.11.2 If-Then-Else
p90 (p111): 4.12 Quantification
p91 (p111): 4.12.1 Existential Quantification
p92 (p113): 4.12.2 Universal Quantification
p93 (p114): 4.13 Jump
p94 (p114): 4.13.1 Exit from a Universally Quantified Statement
p95 (p115): 4.13.2 Exit from an Infinite Loop
p96 (p115): 4.14 Query and Search
p97 (p115): 4.14.1 Approximate Solution
p98 (p116): 4.14.2 Search over a Float Domain
p99 (p117): 4.15 Optimization Objective
p100 (p117): 4.15.1 Single-Objective Optimization
p101 (p117): 4.15.2 Multiple-Objective Optimization
p102 (p118): 4.16 Custom Message
p103 (p119): 4.17 Soft Constraint
p104 (p119): 4.18 Sub-Model
p105 (p119): 4.18.1 Sub-Modelin a File
p106 (p121): 4.18.2 Sub-Model in a Buffer
p107 (p122): 4.18.3 Return Values of a Sub-Model
p108 (p122): 4.18.4 Recursive Sub-Model
p109 (p123): 4.18.5 Overflow in Calling a Sub-Model
p110 (p123): 4.19 SQL Query
p111 (p126): 4.20 OS Command
p112 (p126): 4.21 Expectation and Debugging
p113 (p129): 5 The POEM Software Platform
p114 (p129): 5.1 Main Interface
p115 (p130): 5.1.1 Tool Bar
p116 (p130): 5.1.2 TeX Bar
p117 (p131): 5.1.3 Workspace
p118 (p131): 5.1.4 Edit Window
p119 (p131): 5.1.5 Trace Window
p120 (p132): 5.2 Configuration of a Project
p121 (p132): 5.2.1 Data Pools for a Project
p122 (p132): 5.2.2 NCL Parameters
p123 (p136): 5.2.3 Project Settings
p124 (p138): 5.3 Model Management
p125 (p138): 5.3.1 Model Folder
p126 (p138): 5.3.2 Model Library
p127 (p138): 5.4 Information Tables
p128 (p139): 5.4.1 Running Models
p129 (p139): 5.4.2 Constants
p130 (p140): 5.4.3 Variables
p131 (p141): 5.4.4 Constraints
p132 (p142): 5.5 Visualization and Debugging
p133 (p142): 5.5.1 Quick Watch
p134 (p142): 5.5.2 Browser
p135 (p143): 5.5.3 Constraint Debugger
p136 (p144): 5.5.4 Visual Debugger
p137 (p145): 5.5.5 Solution Viewer
p138 (p146): 5.6 Trace Window and Working Modes
p139 (p146): 56.1 Debug Mode
p140 (p146): 5.6.2 Timer Mode
p141 (p147): 5.6.3 Trace Level
p142 (p147): 5.6.4 Options for Diagnosis
p143 (p147): 5.6.5 Options for Statistics
p144 (p148): 5.6.6 Recommended Diagnosis Mode
p145 (p148): 5.6.7 Recommended Working Mode
p146 (p148): 5.7 Message Management
p147 (p148): 5.7.1 Message Levels
p148 (p149): 5.7.2 Message Types
p149 (p149): 5.7.3 Message Codes
p150 (p150): 5.7.4 Message Handler
p151 (p151): 5.7.5 Termination Status
p152 (p152): 5.8 Help on Line
p153 (p152): 5.9 Component and Server
p154 (p153): 6 Modeling and Solving
p155 (p153): 6.1 Development Principles
p156 (p153): 6.1.1 Generality
p157 (p154): 6.1.2 Data Modeling
p158 (p156): 6.1.3 Modeling Constraints and Objectiyes
p159 (p156): 6.1.4 Modeling Queries
p160 (p158): 6.1.5 Test and Benchmarking
p161 (p158): 6.1.6 Diagnosing a Model
p162 (p160): 6.2 Modeling Abstraction
p163 (p161): 6.2.1 Distinct Integers
p164 (p161): 6.2.2 Disjoint Sets
p165 (p161): 6.2.3 Sorting
p166 (p164): 6.2.4 Set Covering
p167 (p165): 6.2.5 Packing
p168 (p167): 6.2.6 Sum
p169 (p167): 6.2.7 Cumulation
p170 (p168): 6.3 Solving Puzzles
p171 (p168): 6.3.1 Send More Money
p172 (p169): 6.3.2 Primes
p173 (p170): 6.3.3 Integer Sorting
p174 (p170): 6.3.4 Queens
p175 (p171): 6.3.5 Magic Square
p176 (p173): 6.3.6 Sudoku
p177 (p175): 6.3.7 Magic Sequence
p178 (p175): 6.3.8 Einstein's Quiz
p179 (p177): 6.3.9 Calculs d'Enfer
p180 (p179): 6.3.10 Square Packing
p181 (p180): 6.3.11 Knight
p182 (p184): 6.4 Solving Hard Problems
p183 (p184): 6.4.1 Set Partitioning
p184 (p185): 6.4.2 Golf Tournament
p185 (p188): 6.4.3 Progressive Party
p186 (p192): 6.4.4 Ship Loading
p187 (p196): 6.4.5 Job-Shop Scheduling
p188 (p200): 6.4.6 Minimizing the Cost of a Heat Exchanger
p189 (p202): 6.4.7 Pick-up and Delivery
p190 (p211): 6.4.8 Exercises
p191 (p211): References
p192 (p213): 7 Industrial Applications
p193 (p213): 7.1 Complexity of Industrial Problems
p194 (p213): 7.2 Production Scheduling
p195 (p213): 7.2.1 Problem Definition
p196 (p215): 7.2.2 Data Model
p197 (p220): 7.2.3 Simplified Optimization Model
p198 (p226): 7.2.4 Visualizing Time:Gantt Chart
p199 (p226): 7.2.5 Questions
p200 (p227): 7.3 Personnel Planning
p201 (p227): 7.3.1 Problem Definition
p202 (p228): 7.3.2 Data Model
p203 (p234): 7.3.3 Simplified Optimization Model
p204 (p241): 7.3.4 Visualizing Statistics:Histogram
p205 (p241): 7.3.5 Questions
p206 (p241): 7.4 Multi-Modal Transportation Planning
p207 (p241): 7.4.1 Problem Definition
p208 (p242): 7.4.2 Data Model
p209 (p247): 7.4.3 Simplified Optimization Model
p210 (p256): 7.4.4 Visualizing Geographical Information:Map
p211 (p257): 7.4.5 Questions
p212 (p257): References
p213 (p259): 8 Relaxation and Decomposition
p214 (p259): 8.1 Local Optimization by Relaxation
p215 (p259): 8.1.1 Relaxation and Interaction
p216 (p260): 8.1.2 Local Optimization
p217 (p260): 8.1.3 Iterative Optimization for TSP
p218 (p267): 8.2 Solving by Decomposition
p219 (p268): 8.2.1 Solving by Model Decomposition
p220 (p268): 8.2.2 Model Decomposition for Vehicle Routing
p221 (p270): 8.2.3 Solving by Data Decomposition
p222 (p270): 8.2.4 Data Decomposition for Production Scheduling
p223 (p274): References
p224 (p275): Appendix 1 The Grammar in TeX
p225 (p275): Overall Structure
p226 (p276): Declaration
p227 (p276): Explicit Typing
p228 (p276): Function Definition
p229 (p276): Label
p230 (p276): Elementary Statement
p231 (p276): Constraint
p232 (p278): Assignment
p233 (p278): Optimization Objective
p234 (p279): Query and Search
p235 (p276): Enumeration Mode
p236 (p276): Query Criterion
p237 (p280): Output
p238 (p277): Data Format
p239 (p280): Expectation
p240 (p281): Control
p241 (p281): Compound Statement
p242 (p278): Grouped Statement
p243 (p278): Included File
p244 (p278): Soft Statement
p245 (p278): Custom Message
p246 (p281): Selection
p247 (p278): Switch
p248 (p279): If-Then-Else
p249 (p282): Quantification
p250 (p279): Existential Quantification
p251 (p279): Universal Quantification
p252 (p279): Indexing
p253 (p283): Jump
p254 (p283): Data Connection
p255 (p284): Expression
p256 (p284): Boolean
p257 (p284): Float
p258 (p285): Integer
p259 (p286): Date/Time
p260 (p287): String
p261 (p284): Grouped String
p262 (p284): Concatenation
p263 (p287): Reference
p264 (p288): Set
p265 (p291): Constant
p266 (p291): Variable
p267 (p289): System Variable
p268 (p290): Input
p269 (p293): Extraction
p270 (p294): Function
p271 (p294): Data Pool
p272 (p295): Sub-Model
p273 (p295): SQL Query
p274 (p295): OS Command
p275 (p297): Appendix 2 The ComPoem Component
p276 (p297): Description
p277 (p297): Properties
p278 (p297): Functions
p279 (p299): Events
p280 (p301): Index

related_files:
filepath:自然约束语言 英文版_12922952.zip — md5:9497c08bf3f26538ec9e38e13556b300 — filesize:25474111
filepath:自然约束语言 英文版_12922952.zip — md5:1e515e959e1486e91f1f675d959104da — filesize:25474111
filepath:自然约束语言英文版_12922952.zip — md5:6d3302140a5410b57a67a5ffbf46dbd3 — filesize:25437458
filepath:自然约束语言英文版_12922952.zip — md5:6981a14a9aadeec7dc783cff5bc77312 — filesize:25437458
filepath:12922952.zip — md5:315df1044a8b7720f489bc64998d95ae — filesize:25373029
filepath:12922952.zip — md5:68c5056b34c9ff4a6fde7a0739d89c40 — filesize:11704570
filepath:12922952.zip — md5:6cb3128d165b150716825f36459abbaa — filesize:11704570
filepath:12922952.rar — md5:cda151fa80b3cc1914026887056c7d87 — filesize:24985420
filepath:12922952.zip — md5:4ba83247bof63ceb98aed0c97d22718b — filesize:25373029
filepath:843_28_11b/hzts-129(1817册)/自然约束语言 英文版_12922952.zip
filepath:843_28_4a/006湖州师范学院90882(1)/自然约束语言英文版_12922952.zip
filepath:/读秀/读秀4.0/读秀/4.0/数据库25-2/自然约束语言 英文版_12922952.zip
filepath:843_28_1a/001湖州师范学院90882/自然约束语言英文版_12922952.zip

Annotation "The NCL Natural Constraint Language" presents the NCL language which is a description language in conventional mathematical logic for modeling and solving constraint satisfaction problems. NCL differs from other declarative languages: It models problems naturally in a simplified form of first-order logic with quantifiers, Boolean logic, numeric constraints, set operations and logical functions; it solves problems by mixed set programming over the mixed domain of real numbers, integers, Booleans, dates/times, references, and in particular sets. The book uses plenty of examples and tutorials to illustrate NCL and its applications. It is intended for researchers and developers in the fields of logic programming, constraint programming, optimization, modeling, operations research and artificial intelligence, who will learn from a new programming language and theoretical foundations for industrial applications. Dr. Jianyang Zhou is the inventor of NCL and has worked for its industrialization for more than 10 years

Keine Beschreibung vorhanden.
Erscheinungsdatum: 07.09.2012

2024-06-13