Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
Introduction Kapitel lesen Erstes Kapitel lesen

2016 | OriginalPaper | Buchkapitel

7. Programming with Annotated Logics

verfasst von : Kazumi Nakamatsu, Seiki Akama

Erschienen in: Towards Paraconsistent Engineering

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this chapter, we survey paraconsistent annotated logic programs EVALPSN/bf-EVALPSN and their application to intelligent control, especially logical safety verification based control. We have already proposed a paraconsistent annotated logic program called EVALPSN. In EVALPSN, an annotation called an extended vector annotation is attached to each literal. For dealing with before-after relation between two time intervals, we also have introduced a new interpretation for extended vector annotations in EVALPSN, which is named before-after(bf)-EVALPSN. First, we review EVALPSN, and paraconsistent annotated logics \(P\mathcal{T}\) and the basic annotated logic program are given as the formal background of EVALPSN/bf-EVALPSN with some simple examples. Then, EVALPSN is formally defined and its application to traffic signal control is described. We also introduce EVALPSN application to pipeline valve control with examples. Bf-EVALPSN is formally defined and its unique and useful reasoning rules are introduced with some examples. Last, we give some concluding remarks.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Vorheriges Kapitel Paraconsistent Artificial Neural Network for Structuring Statistical Process Control in Electrical Engineering
Nächstes Kapitel A Review on Rough Sets and Possible World Semantics for Modal Logics
Fußnoten
1
An expression \(\lnot p\!:\!\mu \) is conveniently used for expressing a negative annotated literal instead of \(\lnot (p\!:\!\mu )\) or \(p\!:\!\lnot (\mu )\).
 
2
The intersection is supposed to be in Japan where we need to keep left if driving a car.
 
3
Hereafter, expression “before-after” is abbreviated as just “bf” in this chapter.
 
4
If time \(t_1\) is earlier than time \(t_2\), we conveniently denote the before-after relation by the inequality \(t_1 < t_2\).
 
Literatur
1.
Abe, J.M., Akama, S., Nakamatsu, K.: Introduction to Annotated Logics. Springer, Heidelberg (2015)CrossRefMATH
2.
Allen, J.F.: Towards a general theory of action and time. Artif. Intell. 23, 123–154 (1984)CrossRefMATH
3.
4.
Apt, K.R., Blair, H.A., Walker, A.: Towards a theory of declarative knowledge. In: Minker, J. (ed.) Foundation of Deductive Database and Logic Programs, pp. 89–148. Morgan Kaufmann, CA (1989)
5.
Belnap, N.D.: A useful four valued logic. In: Dunn, M., Epstein, G. (eds.) Modern Uses of Multiple-Valued Logic, pp. 8–37. D.Reidel Publishing, Netherlands (1977)
6.
7.
Billington, D.: Conflicting literals and defeasible logic. In: Nayak, A., Pagnucco, M. (eds.) Proceedings of 2nd Australian Workshop Commonsense Reasoning, 1 December, Perth, Australia, Australian Artificial Intelligence Institute, Australia, pp. 1–15 (1997)
8.
9.
da Costa, N.C.A., Subrahmanian, V.S., Vago, C.: The paraconsistent logics P\({\cal T}\). Zeitschrift für Mathematische Logic und Grundlangen der Mathematik 37, 139–148 (1989)
10.
Dressler, O.: An extended basic ATMS, In: Reinfrank, M., et al. (eds.) Proceedings of 2nd International Workshop on Non-monotonic Reasoning, 13–15 June, Grassau, Germany, (Lecture Notes in Computer Science LNCS 346), pp. 143–163. Springer, Heidelberg (1988)
11.
12.
Gelder, A.V., Ross, K.A, Schlipf, J.S.: The well-founded semantics for general logic programs. J. ACM 38, 620–650 (1991)
13.
Jaskowski, S.: Propositional calculus for contradictory deductive system (English translation of the original Polish paper). Studia Logica 24, 143–157 (1948)MathSciNetCrossRef
14.
Kifer, M., Subrahmanian, V.S.: Theory of generalized annotated logic programming and its applications. J. Logic Program. 12, 335–368 (1992)MathSciNetCrossRef
15.
Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Berlin (1987)
16.
Moore, R.: Semantical considerations on non-monotonic logic. Artif. Intell. 25, 75–94 (1985)CrossRefMATH
17.
Nakamatsu, K., Suzuki, A.: Annotated semantics for default reasoning. In: Dai, R. (ed.) Proceedings of 3rd Pacific Rim International Conference on Artificial Intelligence (PRICAI94), 15–18 August, Beijin, China, pp. 180–186. International Academic Publishers, China (1994)
18.
Nakamatsu, K., Suzuki, A.: A nonmonotonic ATMS based on annotated logic programs. In: Wobcke, W., et al. (eds.) Agents and Multi-Agents Systems (Lecture Notes in Artificial Intelligence LNAI 1441), pp. 79–93. Springer, Berlin (1998)
19.
Nakamatsu, K., Abe, J.M.: Reasonings based on vector annotated logic programs. In: Mohammadian, M. (ed.) Computational Intelligence for Modelling, Control and Automation (CIMCA99), (Concurrent Systems Engineering Series 55), pp. 396–403. IOS Press, Netherlands (1999)
20.
Nakamatsu, K., Abe, J.M., Suzuki A.: Defeasible reasoning between conflicting agents based on VALPSN. In: Tessier, C., Chaudron, L. (eds.) Proceedings of AAAI Workshop Agents’ Conflicts, 18 July, Orland, FL, pp. 20–27. AAAI Press, Menlo Park, CA (1999)
21.
Nakamatsu, K., Abe, J.M., Suzuki, A.: Defeasible reasoning based on VALPSN and its application. In: Nayak, A., Pagnucco, M. (eds.) Proceedings of The Third Australian Commonsense Reasoning Workshop, 7 December, Sydney, Australia, University of Newcastle, Sydney, Australia, pp. 114–130 (1999)
22.
Nakamatsu, K.: On the relation between vector annotated logic programs and defeasible theories. Logic Log. Philos. 8, 181–205 (2000)MathSciNetCrossRefMATH
23.
Nakamatsu, K., Abe, J.M., Suzuki, A.: A defeasible deontic reasoning system based on annotated logic programming. In: Dubois, D.M. (ed.) Proceedings of 4th International Conference on Computing Anticipatory Systems (CASYS2000), 7–12 August, 2000, Liege, Belgium, (AIP Conference Proceedings 573), pp. 609–620. American Institute of Physics, NY (2001)
24.
Nakamatsu, K., Abe, J.M., Suzuki, A.: Annotated semantics for defeasible deontic reasoning. In: Ziarko, W., Yao, Y. (eds.) Proceedings of 2nd International Conference on Rough Sets and Current Trends in Computing (RSCTC2000), 16–19 October, 2000, Banff, Canada, (Lecture Notes in Artificial Intelligence LNAI 2005), pp. 432–440. Springer, Berlin (2001)
25.
Nakamatsu, K., Abe, J.M., Suzuki, A.: Extended vector annotated logic program and its application to robot action control and safety verification. In: Abraham, A., et al. (eds.) Hybrid Information Systems (Advances in Soft Computing Series), pp. 665–680. Physica-Verlag, Heidelberg (2002)CrossRef
26.
Nakamatsu, K., Suito, H., Abe, J.M., Suzuki, A.: Paraconsistent logic program based safety verification for air traffic control, In: El Kamel, A., et al. (eds.) Proceedings of IEEE International Conference on System, Man and Cybernetics 02 (SMC02)
27.
Nakamatsu, K., Abe, J.M., Suzuki, A.: A railway interlocking safety verification system based on abductive paraconsistent logic programming. In: Abraham, A., et al. (eds.) Soft Computing Systems (HIS02) (Frontiers in Artificial Intelligence and Applications 87), pp. 775–784. IOS Press, Netherlands (2002)
28.
Nakamatsu, K., Abe, J.M., Suzuki, A.: Defeasible deontic robot control based on extended vector annotated logic programming. In: Dubois, D.M. (ed.) Proceedings of 5th International Conference on Computing Anticipatory Systems (CASYS2001) 13–18 August, 2001, Liege, Belgium, (AIP Conference Proceedings 627), American Institute of Physics, New York, NY, pp. 490–500 (2002)
29.
Nakamatsu, K., Mita, Y., Shibata, T.: Defeasible deontic action control based on paraconsistent logic program and its hardware application. In: Mohammadian, M. (ed.) Proceedings of International Conference on Computational Intelligence for Modelling Control and Automation 2003(CIMCA2003), 12–14 February, Vienna, Austria, IOS Press, Netherlands (CD-ROM) (2003)
30.
Nakamatsu, K., Seno, T., Abe, J.M., Suzuki, A.: Intelligent real-time traffic signal control based on a paraconsistent logic program EVALPSN. In: Wang, G., et al. (eds.) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing (RSFDGrC2003), 26–29 May, Chongqing, China, (Lecture Notes in Artificial Intelligence LNAI 2639), pp. 719–723. Springer, Berlin (2003)CrossRef
31.
Nakamatsu, K., Komaba, H., Suzuki, A.: Defeasible deontic control for discrete events based on EVALPSN. In: Tsumoto, S., et al. (eds.) Proceedings of 4th International Conference on Rough Sets and Current Trends in Computing (RSCTC2004), 1–5 June, Uppsala, Sweeden, (Lecture Notes in Artificial Intelligence LNAI 3066), pp. 310–315. Springer, Berlin (2004)
32.
Nakamatsu, K., Ishikawa, R., Suzuki, A.: A paraconsistent based control for a discrete event cat and mouse. In: Negoita, M.G.H., et al. (eds.) Proceedings of 8th International Conference Knowledge-Based Intelligent Information and Engineering Systems (KES2004), 20–25 September, Wellington, NewZealand, (Lecture Notes in Artificial Intelligence LNAI 3214), pp. 954–960. Springer, Berlin (2004)
33.
Nakamatsu, K., Chung, S.-L., Komaba, H., Suzuki, A.: A discrete event control based on EVALPSN stable model. In: Slezak, D., et al. (eds.) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing (RSFDGrC2005), 31 August - 3 September, Regina, Canada, (Lecture Notes in Artificial Intelligence LNAI 3641), pp. 671–681. Springer, Berlin (2005)CrossRef
34.
Nakamatsu, K., Abe, J.M., Akama, S.: An intelligent safety verification based on a paraconsistent logic program. In: Khosla, R., et al. (eds.) Proceedings of 9th International Conference on Knowledge-Based Intelligent Information and Engineering Systems (KES2005), 14–16 September, Melbourne, australia, (Lecture Notes in Artificial Intelligence LNAI 3682), pp. 708–715. Springer, Berlin (2005)
35.
Nakamatsu, K., Kawasumi, K., Suzuki, A.: Intelligent verification for pipeline based on EVALPSN. In: Nakamatsu, K., Abe, J.M. (eds.) Advances in Logic Based Intelligent Systems (Frontiers in Artificial Intelligence and Applications 132), pp. 63–70. IOS Press, Netherlands (2005)
36.
Nakamatsu, K., Suzuki, A.: Autoepistemic theory and paraconsistent logic program. In: Nakamatsu, K., Abe, J.M. (eds.) Advances in Logic Based Intelligent Systems (Frontiers in Artificial Intelligence and Applications 132), pp. 177–184. IOS Press, Netherlands (2005)
37.
Nakamatsu, K., Suzuki, A.: Annotated semantics for non-monotonic reasonings in artificial intelligence—I, II, III, IV. In: Nakamatsu, K., Abe, J.M. (eds.) Advances in Logic Based Intelligent Systems (Frontiers in Artificial Intelligence and Applications 132), pp. 185–215. IOS Press, Netherlands (2005)
38.
Nakamatsu, K., Mita, Y., Shibata, T.: An intelligent action control system based on extended vector annotated logic program and its hardware implementation. J. Intell. Autom. Soft Comput. 13, 289–304 (2007)CrossRef
39.
Nakamatsu, K.: Paraconsistent annotated logic program EVALPSN and its application. In: Fulcher, J., Jain, C.L. (eds.) Computational Intelligence: A Compendium (Studies in Computational Intelligence 115), pp. 233–306. Springer, Germany (2008)CrossRef
40.
Nakamatsu, K., Abe, J.M.: The development of paraconsistent annotated logic program. Int. J. Reasoning-Based Intell. Syst. 1, 92–112 (2009)CrossRef
41.
Nakamatsu, K., Abe, J.M., Akama, S.: A logical reasoning system of process before-after relation based on a paraconsistent annotated logic program bf-EVALPSN. KES J. 15(3), 146–163 (2011)
42.
Nute, D.: Defeasible reasoning. In: Stohr, E.A., et al. (eds.) Proceedings of 20th Hawaii International Conference on System Science (HICSS87) 1, 6–9 January, Kailua-Kona, Hawaii, University of Hawaii, Hawaii, pp. 470–477 (1987)
43.
Nute, D.: Basic defeasible logics. In: Farinas del Cerro, L., Penttonen, M. (eds.) Intensional Logics for Programming, pp. 125–154. Oxford University Press, UK (1992)
44.
Nute, D.: Defeasible logic. In: Gabbay, D.M., et al. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming 3, pp. 353–396. Oxford University Press, UK (1994)
45.
Nute, D.: Apparent obligatory. In: Nute, D. (ed.) Defeasible Deontic Logic, (Synthese Library 263), pp. 287–316. Kluwer Academic Publisher, Netherlands (1997)CrossRef
46.
Przymusinski, T.C.: On the declarative semantics of deductive databases and logic programs. In: Minker, J. (ed.) Foundation of Deductive Database and Logic Programs, pp. 193–216. Morgan Kaufmann, New York (1988)
47.
48.
Shepherdson, J.C.: Negation as failure, completion and stratification. In: Gabbay, D.M., et al. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming 5, pp. 356–419. Oxford University Press, UK (1998)
49.
50.
Subrahmanian, V.S.: On the semantics of qualitative logic programs. In: Proceedings of the 1987 Symposium Logic Programming (SLP87), August 31–September 4, pp. 173–182. IEEE Computer Society Press, CA (1987)
51.
Visser, A.: Four valued semantics and the liar. J. Philos. Logic 13, 99–112 (1987)MathSciNet
Metadaten
Titel
Programming with Annotated Logics
verfasst von
Kazumi Nakamatsu
Seiki Akama
Copyright-Jahr
2016
Buch
Towards Paraconsistent Engineering

Print ISBN: 978-3-319-40417-2

Electronic ISBN: 978-3-319-40418-9

Copyright-Jahr: 2016

DOI
https://doi.org/10.1007/978-3-319-40418-9_7