Muutke küpsiste eelistusi

E-raamat: Towards Paraconsistent Engineering

Edited by
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 110,53 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Towards Paraconsistent EngineeringSuurem pilt
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

This book presents a collection of contributions from related logics to applied paraconsistency. Moreover, all of them are dedicated to Jair Minoro Abe,on the occasion of his sixtieth birthday. He is one of the experts in Paraconsistent Engineering, who developed the so-called annotated logics. The book includes important contributions on foundations and applications of paraconsistent logics in connection with engineering, mathematical logic, philosophical logic, computer science, physics, economics, and biology. It will be of interest to students and researchers, who are working on engineering and logic.

Introduction.- Why Paraconsistent Logics .- An Application of Paraconsistent Logic to Physics: Complementarity.- Two Genuine 3-Valued Paraconsistent Logics.- A Survey of Annotated Logics.- A Paraconsistent Artificial Neural Network for Structuring Statistical Process Control in Electrical Engineering.- Programming with Annotated Logics.- A Review on Rough Sets and Possible World Semantics for Modal Logics.- Paraconsistency, Chellas"s Conditional Logics, and Association Rules.- A Beautiful Theorem.-Temporal Logic Modeling of Biological Systems.- Jair Minoro Abe on Paraconsistent Engineering.
1 Introduction
1(6)
Seiki Akama
1.1 Backgrounds
1(2)
1.2 About This Book
3(4)
References
5(2)
2 Why Paraconsistent Logics?
7(18)
Seiki Akama
Newton C.A. da Costa
2.1 Introduction
7(1)
2.2 History
8(1)
2.3 Approaches to Paraconsistent Logic
9(7)
2.4 Other Paraconsistent Logics
16(9)
References
22(3)
3 An Application of Paraconsistent Logic to Physics: Complementarity
25(10)
Newton C.A. da Costa
Decio Krause
3.1 Introduction
25(1)
3.2 C-theories
26(1)
3.3 The Logic of C-theories
27(3)
3.4 The Paralogic Associated to a Logic L
30(1)
3.5 More General Complementary Situations
31(1)
3.6 Final Remarks
32(3)
References
33(2)
4 Two Genuine 3-Valued Paraconsistent Logics
35(14)
Jean-Yves Beziau
4.1 Genuine Paraconsistent Negation
35(1)
4.2 Two Genuine Three-Valued Paraconsistent Logics
36(2)
4.3 Basic Properties of SP3A and SP3B
38(4)
4.3.1 Conjunction and Disjunction
38(1)
4.3.2 Laws of Negations that SP3A and SP3B Do Not Obey
38(1)
4.3.3 Excluded Middle
39(1)
4.3.4 Double Negation
39(1)
4.3.5 De Morgan Laws
40(2)
4.3.6 Definition of a Classical Negation
42(1)
4.4 Comparison with da Costa Paraconsistent Logics C1 and C1+
42(4)
4.4.1 Replacement Theorem
45(1)
4.5 Comparison Table Between SP3A and SP3B
46(3)
References
47(2)
5 A Survey of Annotated Logics
49(28)
Seiki Akama
5.1 Introduction
49(1)
5.2 Propositional Annotated Logics Pτ
50(13)
5.3 Predicate Annotated Logics Qτ
63(5)
5.4 Curry Algebras
68(5)
5.5 Formal Issues
73(1)
5.6 Conclusions
74(3)
References
74(3)
6 Paraconsistent Artificial Neural Network for Structuring Statistical Process Control in Electrical Engineering
77(26)
Joao Inacio da Silva Filho
Clovis Misseno da Cruz
Alexandre Rocco
Dorotea Vilanova Garcia
Luis Fernando P. Ferrara
Alexandre Shozo Onuki
Mauricio Conceicao Mario
Jair Minoro Abe
6.1 Introduction
78(5)
6.1.1 Statistical Process Control SPC
78(3)
6.1.2 SPC Analysis
81(2)
6.2 Paraconsistent Logic (PL)
83(2)
6.2.1 Paraconsistent Annotated Logic (PAL)
83(2)
6.3 Paraconsistent Artificial Neural Network (PANNet)
85(3)
6.3.1 Paraconsistent Artificial Neural Cell of Learning (LPANCell)
86(2)
6.4 Computational Structure PAL2v for Simulating SPC
88(12)
6.4.1 Extractor Block of Degrees of Evidence from z-Score
88(1)
6.4.2 Extractor Block of Moving Average
89(1)
6.4.3 Block Comparator of Electrical Energy Quality Score
89(1)
6.4.4 Operation of the Extractor Block of Evidence Degrees from z-Scores
89(3)
6.4.5 Operation of the Extractor Block of Moving Average
92(4)
6.4.6 Operation of Block Comparator of Electric Energy Quality Score
96(4)
6.5 Results
100(1)
6.6 Conclusions
101(2)
References
101(2)
7 Programming with Annotated Logics
103(62)
Kazumi Nakamatsu
Seiki Akama
7.1 Introduction
104(1)
7.2 Paraconsistent Annotated Logic Program
105(6)
7.2.1 Paraconsistent Annotated Logic PT
106(2)
7.2.2 EVALPSN (Extended Vector Annotated Logic Program with Strong Negation)
108(3)
7.3 Traffic Signal Control in EVALPSN
111(7)
7.3.1 Deontic Defeasible Traffic Signal Control
111(5)
7.3.2 Example and Simulation
116(2)
7.4 EVALPSN Safety Verification for Pipeline Control
118(18)
7.4.1 Pipeline Network
119(3)
7.4.2 Pipeline Safety Property
122(1)
7.4.3 Predicates for Safety Verification
122(5)
7.4.4 Safety Property in EVALPSN
127(2)
7.4.5 Process Release Control in EVALPSN
129(2)
7.4.6 Example
131(5)
7.5 Before-After EVALPSN
136(15)
7.5.1 Before-After Relation in EVALPSN
136(6)
7.5.2 Implementation of Bf-EVALPSN Verification System
142(3)
7.5.3 Safety Verification in Bf-EVALPSN
145(6)
7.6 Reasoning in Bf-EVALPSN
151(10)
7.6.1 Basic Reasoning for Bf-Relation
151(3)
7.6.2 Transitive Reasoning for Bf-Relations
154(4)
7.6.3 Transitive Bf-Inference Rules
158(3)
7.7 Conclusions and Remarks
161(4)
References
162(3)
8 A Review on Rough Sets and Possible World Semantics for Modal Logics
165(14)
Yasuo Kudo
Tetsuya Murai
Seiki Akama
8.1 Introduction
165(1)
8.2 Modal Logics
166(3)
8.2.1 Language
166(1)
8.2.2 Possible World Semantics for Modal Logics
166(3)
8.3 Rough Sets
169(3)
8.3.1 Pawlak's Rough Set
169(1)
8.3.2 Variable Precision Rough Set
170(1)
8.3.3 Properties of Lower and Upper Approximations
171(1)
8.4 Connections Between Rough Sets and Modal Logics
172(3)
8.4.1 Pawlak Approximation Spaces as Kripke Models
172(1)
8.4.2 Possible World Semantics with Variable Precision Rough Sets
173(2)
8.5 Related Works
175(1)
8.6 Conclusion
176(3)
References
176(3)
9 Paraconsistency, Chellas's Conditional Logics, and Association Rules
179(18)
Tetsuya Murai
Yasuo Kudo
Seiki Akama
9.1 Introduction
180(1)
9.2 Chellas's Conditional Models and Their Measure-Based Extensions for Conditional Logics
180(4)
9.2.1 Standard and Minimal Conditional Models
180(2)
9.2.2 Measure-Based Extensions
182(2)
9.3 Paraconsistency and Paracompleteness in Conditionals
184(2)
9.3.1 Modal Logic Case
184(1)
9.3.2 Conditional Logic Case
185(1)
9.4 Paraconsistency and Paracompleteness in Association Rules
186(4)
9.4.1 Association Rules
186(2)
9.4.2 Measure-Based Conditional Models for Databases
188(1)
9.4.3 Association Rules and Graded Conditionals
188(1)
9.4.4 Paraconsistency and Paracompleteness in Association Rules
189(1)
9.5 Dempster-Shafer-Theory-Based Confidence
190(5)
9.5.1 D-S Theory and Confidence
190(1)
9.5.2 Multi-graded Conditional Models for Databases
191(1)
9.5.3 Two Typical Cases
191(3)
9.5.4 General Cases
194(1)
9.6 Concluding Remarks
195(2)
References
196(1)
10 A Beautiful Theorem
197(8)
Francisco Antonio Doria
Carlos A. Cosenza
10.1 Prologue
197(1)
10.2 Theme
198(1)
10.3 Theme and Variations
199(2)
10.4 The O'Donnell Algorithm
201(1)
10.5 Almost Maymin--Efficient Markets
202(3)
References
203(2)
11 Temporal Logic Modeling of Biological Systems
205(22)
Jean-Marc Alliot
Robert Demolombe
Martin Dieguez
Luis Farinas del Cerro
Gilles Favre
Jean-Charles Faye
Naji Obeid
Olivier Sordet
11.1 Introduction
205(1)
11.2 A Simple Classical Example
206(3)
11.3 Fundamental Operations
209(2)
11.4 Molecular Interaction Logic
211(2)
11.4.1 MIL Semantics
212(1)
11.5 Translating Molecular Interaction Logic into Linear Time Temporal Logic
213(2)
11.5.1 From MIL to LTL
214(1)
11.6 Temporal Reasoning
215(4)
11.6.1 Completion Axioms
215(1)
11.6.2 Graphs as Splittable Temporal Logic Programs
216(2)
11.6.3 Grounding Splittable Temporal Logic Programs
218(1)
11.7 Reasoning and Solving
219(5)
11.7.1 A Simple Example
219(3)
11.7.2 From Temporal Reasoning to Classical Propositional Tools
222(1)
11.7.3 Expressing Complex Queries
223(1)
11.8 Implementation
224(1)
11.9 Conclusion
224(3)
References
225(2)
12 Jair Minoro Abe on Paraconsistent Engineering
227(5)
Seiki Akama
12.1 Introduction
227(1)
12.2 Biographical Information
228(2)
12.3 General Description of Published Works
230(2)
References 232
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97833194041892e.html
Märksõnad: