Skip to main content

Paraconsistent Annotated Logic Program Before-after EVALPSN and Its Application

  • Chapter
Book cover Foundations of Computational Intelligence Volume 2

Part of the book series: Studies in Computational Intelligence ((SCI,volume 202))

  • 774 Accesses

Summary

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 introduce a new interpretation for extended vector annotations in EVALPSN, which is named Before-after(bf) EVALPSN.

In this chapter, we introduce the bf-EVALPSN and its application to real-time process order control and its safety verification with simple examples. First, the background and overview of EVALPSN are introduced, and paraconsistent annotated logic as the formal background of EVALPSN and EVALPSN itself are recapitulated with simple examples. Then, after 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 are introduced, and conclusions and remarks are provided.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allen, J.F.: Towards a General Theory of Action and Time. Artificial Intelligence 23, 123–154 (1984)

    Article  MATH  Google Scholar 

  2. Allen, J.F., Ferguson, G.: Actions and Events in Interval Temporal Logic. J. Logic and Computation 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, San Francisco (1989)

    Google Scholar 

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

    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.) Proc. 2nd Australian Workshop Commonsense Reasoning, December 1, pp. 1–15. Australian Artificial Intelligence Institute, Australia (1997)

    Google Scholar 

  7. Blair, H.A., Subrahmanian, V.S.: Paraconsistent logic programming. Theoretical Computer Science 68, 135–154 (1989)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  9. Dressler, O.: An extended basic ATMS. In: Reinfrank, M., Ginsberg, M.L., de Kleer, J., Sandewall, E., et al. (eds.) Non-Monotonic Reasoning 1988. LNCS, vol. 346, pp. 143–163. Springer, Heidelberg (1988)

    Google Scholar 

  10. Fitting, M.: Bilattice and the semantics of logic programming. J. Logic Programming 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). Studia 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)

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  16. Morley, J. M.: Safety Assurance in Interlocking Design. Ph.D Thesis, School of Informatics, University of Edinburgh (1996)

    Google Scholar 

  17. Nakamatsu, K., Suzuki, A.: Annotated semantics for default reasoning. In: Dai, R. (ed.) Proc. 3rd Pacific Rim Intl. Conf. Artificial Intelligence(PRICAI 1994), Beijin, China, August 15–18, pp. 180–186. International Academic Publishers, China (1994)

    Google Scholar 

  18. Nakamatsu, K., Suzuki, A.: A nonmonotonic ATMS based on annotated logic programs. In: Wobcke, W., Pagnucco, M., Zhang, C., et al. (eds.) Agents and Multi-Agent Systems Formalisms, Methodologies, and Applications. LNCS (LNAI), vol. 1441, pp. 79–93. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

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

    Google Scholar 

  20. Nakamatsu, K., Abe, J.M., Suzuki, A.: Defeasible reasoning between conflicting agents based on VALPSN. In: Tessier, C., Chaudron, L. (eds.) Proc. AAAI Workshop Agents’ Conflicts, Orland, FL, July 18, pp. 20–27. AAAI Press, Menlo Park (1999)

    Google Scholar 

  21. Nakamatsu, K., Abe, J.M., Suzuki, A.: Defeasible reasoning based on VALPSN and its application. In: Nayak, A., Pagnucco, M. (eds.) Proc. The Third Australian Commonsense Reasoning Workshop, Sydney, Australia, December 7, pp. 114–130. University of Newcastle, Sydney (1999)

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  23. Nakamatsu, K., Abe, J.M., Suzuki, A.: A defeasible deontic reasoning system based on annotated logic programming. In: Dubois, D.M. (ed.) Proc. 4th Intl. Conf. Computing Anticipatory Systems(CASYS 2000), Liege, Belgium, August 7–12. AIP Conference Proceedings, vol. 573, pp. 609–620. American Institute of Physics, New York (2000)

    Google Scholar 

  24. Nakamatsu, K., Abe, J.M., Suzuki, A.: Annotated semantics for defeasible deontic reasoning. In: Ziarko, W.P., Yao, Y. (eds.) RSCTC 2000. LNCS (LNAI), vol. 2005, pp. 432–440. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  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)

    Google Scholar 

  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.) Proc. IEEE Intl. Conf. System, Man and Cybernetics 2002 (SMC 2002), Hammamet, Tunisia, October 6–9, IEEE SMC, Los Alamitos (2002)

    Google Scholar 

  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(HIS 2002). Frontiers in Artificial Intelligence and Applications, vol. 87, pp. 775–784. IOS Press, Netherlands (2002)

    Google Scholar 

  28. 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(CASYS 2001), Liege, Belgium, August 13–18. AIP Conference Proceedings, vol. 627, pp. 490–500. American Institute of Physics, New York (2002)

    Google Scholar 

  29. Nakamatsu, K., Mita, Y., Shibata, T.: Defeasible deontic action control based on paraconsistent logic program and its hardware application. In: Mohammadian, M. (ed.) Proc. Intl. Conf. Computational Intelligence for Modelling Control and Automation 2003 (CIMCA 2003), February 12–14, IOS Press, Netherlands (2003)

    Google Scholar 

  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., Liu, Q., Yao, Y., Skowron, A., et al. (eds.) RSFDGrC 2003. LNCS (LNAI), vol. 2639, pp. 719–723. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  31. Nakamatsu, K., Komaba, H., Suzuki, A.: Defeasible deontic control for discrete events based on EVALPSN. In: Tsumoto, S., Słowiński, R., Komorowski, J., Grzymała-Busse, J.W., et al. (eds.) RSCTC 2004. LNCS (LNAI), vol. 3066, pp. 310–315. Springer, Heidelberg (2004)

    Google Scholar 

  32. Nakamatsu, K., Ishikawa, R., Suzuki, A.: A paraconsistent based control for a discrete event cat and mouse. In: Negoita, M.G., Howlett, R.J., Jain, L.C., et al. (eds.) KES 2004. LNCS (LNAI), vol. 3214, pp. 954–960. Springer, Heidelberg (2004)

    Google Scholar 

  33. Nakamatsu, K., Chung, S.-L., Komaba, H., Suzuki, A.: A discrete event control based on EVALPSN stable model. In: Ślȩzak, D., Wang, G., Szczuka, M.S., Düntsch, I., Yao, Y., et al. (eds.) RSFDGrC 2005. LNCS (LNAI), vol. 3641, pp. 671–681. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  34. Nakamatsu, K., Abe, J.M., Akama, S.: An intelligent safety verification based on a paraconsistent logic program. In: Khosla, R., Howlett, R.J., Jain, L.C., et al. (eds.) KES 2005. LNCS (LNAI), vol. 3682, pp. 708–715. Springer, Heidelberg (2005)

    Google Scholar 

  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, vol. 132, pp. 63–70. IOS Press, Netherlands (2005)

    Google Scholar 

  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, vol. 132, pp. 177–184. IOS Press, Netherlands (2005)

    Google Scholar 

  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, vol. 132, pp. 185–215. IOS Press, Netherlands (2005)

    Google Scholar 

  38. Nakamatsu, K.: Pipeline valve control based on EVALPSN safety verification. J. Advanced Computational Intelligence and Intelligent Informatics 10, 647–656 (2006)

    Google Scholar 

  39. Nakamatsu, K., Mita, Y., Shibata, T.: An intelligent action control system based on extended vector annotated logic program and its hardware implementation. J. Intelligent Automation and Soft Computing 13, 289–304 (2007)

    Google Scholar 

  40. 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, vol. 115, pp. 233–306. Springer, Germany (2008)

    Chapter  Google Scholar 

  41. Nute, D.: Defeasible reasoning. In: Stohr, E.A., et al. (eds.) Proc. 20th Hawaii Intl. Conf. System Science (HICSS 1987), Kailua-Kona, Hawaii, January 6–9, pp. 470–477. University of Hawaii, Hawaii (1987)

    Google Scholar 

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

    Google Scholar 

  43. Nute, D.: Defeasible logic. In: Gabbay, D.M., et al. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3, pp. 353–396. Oxford University Press, Oxford (1994)

    Google Scholar 

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

    Google Scholar 

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

  46. Reiter, R.: A logic for default reasoning. Artificial Intelligence 13, 81–123 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  47. 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, vol. 5, pp. 356–419. Oxford University Press, Oxford (1998)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  49. Subrahmanian, V.S.: On the semantics of qualitative logic programs. In: Proc. the 1987 Symp. Logic Programming (SLP 1987), August 31–September 4, pp. 173–182. IEEE Computer Society Press, San Francisco (1987)

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Nakamatsu, K. (2009). Paraconsistent Annotated Logic Program Before-after EVALPSN and Its Application. In: Hassanien, AE., Abraham, A., Herrera, F. (eds) Foundations of Computational Intelligence Volume 2. Studies in Computational Intelligence, vol 202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01533-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01533-5_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01532-8

  • Online ISBN: 978-3-642-01533-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics