Skip to main content
SpringerLink
Log in

Paraconsistent Annotated Logic Programs and Application to Intelligent Verification Systems

  • Chapter
  • First Online:
Innovations in Intelligent Machines-4

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

  • 736 Accesses

Abstract

Paraconsistent Logic is well known as a logical tool that can deal with inconsistency in a consistent logical system. In this chapter we introduce the development of a paraconsistent annotated logic program called Extended Vector Annotated Logic Program with Strong Negation (abbr. EVALPSN). First of all, we review paraconsistent annotated logics P T and their logic programs, and introduce the development from the paraconsistent logics P T to EVALPSN and their formal definitions. Furthermore, we introduce one version of EVALPSN named before-after (abbr. bf)-EVALPSN, which can deal with before-after relations between two time intervals, and its reasoning system consists of two kinds of inference rules with an example. We also provide a bf-EVALPSN based safety verification system for a pipeline process order control with simple examples.

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

Access this chapter

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
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

Notes

  1. 1.

    Generally the symbol T represents plural complete lattices of annotations, therefore, if there is no specification for the complete lattice T, assume that P T represents plural annotated logics in this chapter.

  2. 2.

    Hereafter expression ¬p:μ is conveniently used for expressing a negative annotated literal instead of ¬(p:μ) or p:¬(μ).

  3. 3.

    We use the right arrow symbol → in program clauses as a logical connective as far as no confusion occurs.

  4. 4.

    In this chapter, process Pr id is represented as p id in bf-EVALPSN literal.

  5. 5.

    If time t 1 is earlier than t 2, we conveniently denote the relation by inequality.

  6. 6.

    The bottom vector annotation (0,0) in transitive bf-inference rules implies that any vector annotation (i,j) satisfies it.

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  MathSciNet  MATH  Google Scholar 

  3. Billington, D.: Defeasible logic is stable. J. Logic Comput. 3, 379–400 (1997)

    Article  MathSciNet  Google Scholar 

  4. Billington, D.: Conflicting literals and defeasible logic. Proceedings 2nd Australian Workshop Commonsense Reasoning, pp. 1–15. Australian Artificial Intelligence Institute, Perth, Australia, (1997)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. da Costa, N. C. A. et al.: The paraconsistent logics PT. Zeitschrift f¨ur Mathematische Logic und Grundlangen der Mathematik 37, 139–148 (1989)

    Google Scholar 

  7. Dressler, O.: An extended basic ATMS. Proceedings of 2nd International Workshop on Non-monotonic Reasoning. LNCS, vol. 346, pp. 143–163 (1988)

    Google Scholar 

  8. Geerts, P. et al.: Defeasible logics. Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol. 2, pp. 175–210. Springer (1998)

    Google Scholar 

  9. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. Proceedings of 5th International Conference and Symposium Logic Programming (ICLP/SLP88), pp. 1070–1080. The MIT Press (1989)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  13. McNamara, P., Prakken, H.: (eds.) Norms, Logics and Information Systems. Frontiers in Artificial Intelligence and Applications, vol. 49, IOS Press (1999)

    Google Scholar 

  14. Meyer, J–J.C., Wiering, R.J.: (eds.) Logic in Computer Science. Wiley (1993)

    Google Scholar 

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

    Article  Google Scholar 

  16. Nakamatsu, K., Suzuki, A.: Annotated semantics for default reasoning. Proceedings of 3rd Pacific Rim International Conference Artificial Intelligence (PRICAI94), pp. 180–186. International Academic Publishers (1994)

    Google Scholar 

  17. Nakamatsu, K., Suzuki, A.: A nonmonotonic ATMS based on annotated logic programs. LNAI 1441, 79–93, Springer (1998)

    Google Scholar 

  18. Nakamatsu, K., et al.: Defeasible reasoning between conflicting agents based on VALPSN. Proceedings of AAAI Workshop Agents’ Conflicts, pp. 20–27. AAAI Press (1999)

    Google Scholar 

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

    MathSciNet  Google Scholar 

  20. Nakamatsu, K., et al.: A defeasible deontic reasoning system based on annotated logic programming. Proceedings of 4th International Conference Computing Anticipatory Systems (CASYS2000), AIP Conference Proceedings, vol. 573, pp. 609–620. American Institute of Physics, (2001)

    Google Scholar 

  21. Nakamatsu, K., et al.: Annotated semantics for defeasible deontic reasoning. LNAI 2005, 432–440 (2001)

    Google Scholar 

  22. Nakamatsu, K., et al.: Paraconsistent logic program based safety verification for air traffic control. Proceedings of IEEE International Conference System, Man and Cybernetics 02(SMC02), CD-ROM, IEEE SMC (2002)

    Google Scholar 

  23. Nakamatsu, K., et al.: A railway interlocking safety verification system based on abductive paraconsistent logic programming. Proceedings of Soft Computing Systems (HIS02), Frontiers in Artificial Intelligence and Applications, vol. 7, pp. 775–784. IOS Press (2002)

    Google Scholar 

  24. Nakamatsu, K., Seno, T., Abe, J. M., Suzuki, A.: Intelligent real-time traffic signal control based on a paraconsistent logic program EVALPSN. In: Rough Sets, Fuzzy Sets, Data Mining and Granular Computing (RSFDGrC2003), LNAI vol. 2639, pp. 719–723. (2003)

    Google Scholar 

  25. Nakamatsu, K., KOmaba, H., Suzuki, A.: Defeasible deontic control for discrete events based on EVALPSN. Proceedings of 4th International Conference Rough Sets and Current Trends in Computing (RSCTC2004), LNAI, vol. 3066, pp. 310–315 (2004)

    Google Scholar 

  26. Nakamatsu, K., Ishikawa, R., Suzuki, A.: A paraconsistent based control for a discrete event cat and mouse. Proceedings of 8th International Conference Knowledge-Based Intelligent Information and Engineering Systems (KES2004), LNAI, vol. 3214, pp. 954–960 (2004)

    Google Scholar 

  27. Nakamatsu, K., Suzuki, A.: Autoepistemic theory and paraconsistent logic program. Advances in Logic Based Intelligent Systems, Frontiers in Artificial Intelligence and Applications, vol. 132, pp. 177–184. IOS Press (2005)

    Google Scholar 

  28. Nakamatsu, K.: Pipeline valve control based on EVALPSN safety verification. J Adv. Comput. Intell. Intell. Inf. 10, 647–656 (2006)

    Google Scholar 

  29. 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, 222–237 (2007)

    Google Scholar 

  30. Nakamatsu, K., Akama, S., Abe, J.M.: Transitive reasoning of before-after relation based on Bf-EVALPSN. Knowl. Based Intell. Inf. Eng. Syst. LNCS 5178, 474–482 (2008)

    Article  Google Scholar 

  31. Nakamatsu, K.: The paraconsistent annotated logic program EVALPSN and its application. In: Computational Intelligence: A Compendium, Studies in Computational Intelligence, vol. 115, pp. 233–306. Springer (2008)

    Google Scholar 

  32. Nute, D.: Defeasible reasoning. Proceedings of 20th Hawaii International Conference System Science (HICSS87) vol. 1, pp. 470–477 (1987)

    Google Scholar 

  33. Nute, D.: Basic defeasible logics. Intensional Logics for Programming, pp. 125–154. Oxford University Press (1992)

    Google Scholar 

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

    Google Scholar 

  35. Nute, D.: Apparent obligatory. Defeasible Deontic Logic, Synthese Library, vol. 263, pp. 287–316. Kluwer Academic Publishers (1997)

    Google Scholar 

  36. Prakken, H.: Logical Tools for Modelling Legal Argument. Law and Philosophy Library, vol. 32, Kluwer Academic Publishers (1997)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  38. Subrahmanian, V.S.: On the semantics of qualitative logic programs. Proceedings the 1987 Symposium Logic Programming (SLP87), pp. 173–182. IEEE CS Press (1987)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Kazumi Nakamatsu

  2. ICET-Paulista University, R. Dr. Bacelar CEP, Sao Paulo, SP, 04026-022, Brazil

    Jair M. Abe

  3. Institute of Advanced Studies, University of Sao Paulo, Rua Praa do Relogio, 109, Bloco K, 5 andar Cidade Universitaria, CEP, Sao Paulo, SP, 05508-970, Brazil

    Jair M. Abe

Authors
  1. Kazumi Nakamatsu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jair M. Abe
    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. Ecole Polytechnique Universitaire de Marseille, Aix-Marseille University (AMU), Marseille, France

    Colette Faucher

  2. Faculty of Education, Science, Technology & Mathematics, University of Canberra, Canberra, Australia

    Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Nakamatsu, K., Abe, J.M. (2014). Paraconsistent Annotated Logic Programs and Application to Intelligent Verification Systems. In: Faucher, C., Jain, L. (eds) Innovations in Intelligent Machines-4. Studies in Computational Intelligence, vol 514. Springer, Cham. https://doi.org/10.1007/978-3-319-01866-9_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-01866-9_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-01865-2

  • Online ISBN: 978-3-319-01866-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation