Skip to main content
SpringerLink
Log in
Book cover

Paraconsistent Intelligent-Based Systems pp 39–85Cite as

Paraconsistent Annotated Logic Program EVALPSN and Its Applications

  • Chapter
  • First Online:

  • 472 Accesses

Part of the book series: Intelligent Systems Reference Library ((ISRL,volume 94))

Abstract

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. In order to deal 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. In this chapter, we review paraconsistent annotated logic programs EVALPSN/bf-EVALPSN from the view point of application to safety verification and process order control with simple examples. First, the background and overview of EVALPSN are introduced, and paraconsistent annotated logics \(P {\mathcal{T}}\) and the basic annotated logic program are recapitulated as the formal background of EVALPSN with some simple examples. Then, bf-EVALPSN is formally defined, how to implement and apply bf-EVALPSN to real-time intelligent process order control and its safety verification with simple practical examples. Last, unique and useful features of bf-EVALPSN called transitive bf-inference rules are introduced, and this chapter is concluded with some remarks.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    An expression \(\neg p:\mu\) is conveniently used for expressing a negative annotated literal instead of \(\neg (p:\mu )\) or \(p:\neg (\mu )\).

  2. 2.

    The intersection is supposed to be in Japan where we need to keep left if driving a car.

  3. 3.

    Hereafter, the expression “before-after” is abbreviated as just “bf” in this chapter.

  4. 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}\).

References

  1. Allen, J.F.: Towards a general theory of action and time. Artif. Intell. 23, 123–154 (1984)

    Article  MATH  Google Scholar 

  2. Allen, J.F., Ferguson, G.: Actions and events in interval temporal logic. J. Logic Comput. 4, 531–579 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  3. 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 (1989)

    Google Scholar 

  4. Belnap, N.D.: A useful four valued logic. In: Dunn, M., Epstein, G. (eds.) Modern Uses of Multiple-Valued Logic. D.Reidel Publishing, Netherlands (1977)

    Google Scholar 

  5. Billington, D.: Defeasible logic is stable. J. Logic and Computation 3, 379–400 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  6. Billington, D.: Conflicting literals and defeasible logic. In: Nayak A, Pagnucco M (eds.) Proceedings of 2nd Australian Workshop Commonsense Reasoning, pp. 1–15, Australian Artificial Intelligence Institute, Sydney, 1 Dec 1997

    Google Scholar 

  7. Blair, H.A., Subrahmanian, V.S.: Paraconsistent logic programming. Theoret. Comput. Sci. 68, 135–154 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  8. da Costa, N.C.A., Subrahmanian, V.S., Vago, C,: The paraconsistent logics \({\text{P}}{\mathcal{T}}\). Zeitschrift für Mathematische Logic und Grundlangen der Mathematik 37, 139–148 (1997)

    Google Scholar 

  9. Dressler, O.: An extended basic ATMS, In: Reinfrank, M., et al. (eds.) Proceedings of 2nd International Workshop on Non-Monotonic Reasoning, Grassau, Germany, (Lecture Notes in Computer Science LNCS 346), pp. 143–163. Springer, Heidelberg, 13–15 June 1988

    Google Scholar 

  10. Fitting, M.: Bilattice and the semantics of logic programming. J. Logic Program. 11, 91–116 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  11. Gelder, A.V., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. J. ACM 38, 620–650 (1991)

    MATH  Google Scholar 

  12. Jaskowski, S.: Propositional calculus for contradictory deductive system (English translation of the original Polish paper). Stud. Logica. 24, 143–157 (1948)

    Article  MathSciNet  Google Scholar 

  13. Kifer, M., Subrahmanian, V.S.: Theory of generalized annotated logic programming and its applications. J. Logic Programming 12, 335–368 (1992)

    Article  MathSciNet  Google Scholar 

  14. Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Berlin (1987)

    Book  MATH  Google Scholar 

  15. Moore, R.: Semantical considerations on non-monotonic logic. Artif. Intell. 25, 75–94 (1985)

    Article  MATH  Google Scholar 

  16. Nakamatsu, K., Suzuki, A.: Annotated semantics for default reasoning. In: Dai, R. (ed.) Proceedings of 3rd Pacific Rim International Conference Artificial Intelligence(PRICAI94), pp.180–186, International Academic Publishers, Beijin, China, 15–18 Aug 1994

    Google Scholar 

  17. 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)

    Google Scholar 

  18. Nakamatsu, K., Abe, J.M.: Reasonings based on vector annotated logic programs. Mohammadian M (ed.) Computational Intelligence for Modelling, Control & Automation (CIMCA99), (Concurrent Systems Engineering Series 55), pp. 396–403. IOS Press, Netherlands (1999)

    Google Scholar 

  19. 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, pp. 20–27. Orland, FL, AAAI Press, Menlo Park, 18 July 1999

    Google Scholar 

  20. 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, Sydney, Australia, pp. 114–130. University of Newcastle, Sydney, Australia, 7 Dec 1999

    Google Scholar 

  21. Nakamatsu, K.: On the relation between vector annotated logic programs and defeasible theories. Logic and Logical Philosophy 8, 181–205 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  22. Nakamatsu, K., Abe, J.M., Suzuki, A.: A defeasible deontic reasoning system based on annotated logic programming. In: Dubois, D.M. (ed.) Proceedings 4th International Conference Computing Anticipatory Systems(CASYS2000), Liege, Belgium, (AIP Conference Proceedings 573), pp. 609–620. American Institute of Physics, New York, 7–12 Aug 2001

    Google Scholar 

  23. Nakamatsu, K., Abe, J.M., Suzuki, A.: Annotated semantics for defeasible deontic reasoning. In: Ziarko W, Yao Y (eds.) Proc. 2nd Intl. Conf. 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)

    Google Scholar 

  24. 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)

    Google Scholar 

  25. 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), Hammamet, Tunisia, IEEE SMC (CD-ROM), 6–9 Oct 2002

    Google Scholar 

  26. 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)

    Google Scholar 

  27. Nakamatsu, K., Abe, J.M., Suzuki, A.: Defeasible deontic robot control based on extended vector annotated logic programming. In: Dubois, D.M. (ed.) Proc. 5th Intl. Conf. Computing Anticipatory Systems(CASYS2001), Liege, Belgium, (AIP Conference Proceedings 627), pp. 490–500. American Institute of Physics, New York, 13–18 Aug 2002

    Google Scholar 

  28. 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 Computational Intelligence for Modelling Control and Automation 2003(CIMCA2003), Vienna, Austria, IOS Press, Netherlands (CD-ROM) 12–14 Feb 2003

    Google Scholar 

  29. Nakamatsu, K., Seno. T., Abe, J.M., Suzuki, A.: (2003) 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), Chongqing, China, (Lecture Notes in Artificial Intelligence LNAI 2639), pp. 719–723. Springer, Berlin, 26–29 May 2003

    Google Scholar 

  30. 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), Uppsala, Sweeden, (Lecture Notes in Artificial Intelligence LNAI 3066), pp. 310–315. Springer, Berlin, 1–5 June 2004

    Google Scholar 

  31. 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 8th International Conference Knowledge-Based Intelligent Information and Engineering Systems(KES2004), Wellington, NewZealand, (Lecture Notes in Artificial Intelligence LNAI 3214), pp. 954–960. Springer, Berlin, 20–25 Sept 2004

    Google Scholar 

  32. 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), Regina, Canada, (Lecture Notes in Artificial Intelligence LNAI 3641), pp. 671–681. Springer, Berlin, 31 Aug–3 Sept 2005

    Google Scholar 

  33. 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 Knowledge-Based Intelligent Information and Engineering Systems(KES2005), Melbourne, Australia, (Lecture Notes in Artificial Intelligence LNAI 3682), pp. 708–715. Springer, Berlin, 14–16 Sept 2005

    Google Scholar 

  34. 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)

    Google Scholar 

  35. 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)

    Google Scholar 

  36. 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)

    Google Scholar 

  37. 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)

    Article  Google Scholar 

  38. 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-Verlag, Germany (2008)

    Chapter  Google Scholar 

  39. Nute, D.: Defeasible reasoning. In: Stohr, E.A., et al. (eds.) Proceedings of 20th Hawaii Intlernational Conference on System Science(HICSS87), pp. 470–477. Kailua-Kona, Hawaii, University of Hawaii, Hawaii, 1, 6–9 Jan 1987

    Google Scholar 

  40. Nute, D.: Basic defeasible logics. In: del Cerro, L.F., Penttonen, M. (eds.) Intensional Logics for Programming, pp. 125–154. Oxford University Press, UK (1992)

    Google Scholar 

  41. 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)

    Google Scholar 

  42. Nute, D.: Apparent obligatory. In: Nute, D. (ed.) Defeasible Deontic Logic, (Synthese Library 263), pp. 287–316. Kluwer Academic Publisher, Netherlands (1997)

    Chapter  Google Scholar 

  43. 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)

    Google Scholar 

  44. Reiter, R.: A logic for default reasoning. Artif. Intell. 13, 81–123 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  45. 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)

    Google Scholar 

  46. Subrahmanian, V.S.: Amalgamating knowledge bases. ACM Trans. Database Syst. 19, 291–331 (1994)

    Article  MathSciNet  Google Scholar 

  47. Subrahmanian, V.S.: On the semantics of qualitative logic programs. In: Proceedings the 1987 Symp. Logic Programming(SLP87), IEEE Computer Society Press, pp. 173–182. San Francisco, CA, 31 Aug–4 Sept 1987

    Google Scholar 

  48. Visser, A.: Four valued semantics and the liar. J. Philosophical Logic 13, 99–112 (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Human Science and Environment, University of Hyogo, 1-1-12 Shinzaike, Himeji, 670-0092, Japan

    Kazumi Nakamatsu

  2. Graduate Program in PE, ICET, Paulista University, R. Dr. Bacelar, 1212, São Paulo, 04026-002, Brazil

    Jair Minoro Abe

  3. Inst. Advanced Studies, University of São Paulo, Travessa J, 374 Terreo, Cidade Universitaria, São Paulo, 05508-900, Brazil

    Jair Minoro Abe

  4. C-Republic, 1-20-1, Higashi-Yurigaoka, Asao-Ku, Kawasaki, 215-0012, Japan

    Seiki Akama

Authors
  1. Kazumi Nakamatsu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jair Minoro Abe
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Seiki Akama
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kazumi Nakamatsu .

Editor information

Editors and Affiliations

  1. São Paulo, Brazil

    Jair Minoro Abe

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Nakamatsu, K., Abe, J.M., Akama, S. (2015). Paraconsistent Annotated Logic Program EVALPSN and Its Applications. In: Abe, J. (eds) Paraconsistent Intelligent-Based Systems. Intelligent Systems Reference Library, vol 94. Springer, Cham. https://doi.org/10.1007/978-3-319-19722-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19722-7_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19721-0

  • Online ISBN: 978-3-319-19722-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation