Skip to main content
SpringerLink
Log in

The Paraconsistent Annotated Logic Program EVALPSN and its Application

  • Chapter
Computational Intelligence: A Compendium

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

The main purpose of paraconsistent logic is to deal with inconsistency in a framework for consistent logical systems. It has been almost six decades since the first paraconsistent logical system was proposed by [13]. It was four decades later that a family of paraconsistent logic called ‘annotated logics’ was proposed by [6,51]. It can deal with inconsistency by introducing many truth values called ‘annotations’ that should be attached to each atomic formula, although their semantics is basically two-valued.

The paraconsistent annotated logic was developed from the viewpoint of logic programming, aiming at application to Computer Science such as the semantics for knowledge bases by [5,14,50]. Furthermore, in order to deal with inconsistency and non-monotonic reasoning in a framework of annotated logic programming, the paraconsistent annotated logic program [5] was developed to have ontological (strong) negation and stable model semantics [10] by [20], and was named Annotated Logic Program with Strong Negation (ALPSN for short). It has been applied to some non-monotonic systems, default logic [48], autoepistemic logic [18] and a non-monotonic ATMS (Assumption Based Truth Maintenance System) [7] as their computational models [21, 39, 40].

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 389.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 499.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. Apt K, et al. (1988) Towards a theory of declarative knowledge. In: Minker J (ed) Foundation of Deductive Database and Logic Programs. Morgan Kaufmann, San Mateo, CA: 89-148.

    Google Scholar 

  2. Belnap ND (1977) A useful four-valued logic. In: Reidel D (ed) Modern Uses of Many-Valued Logic: 8-37.

    Google Scholar 

  3. Billington D (1993) Defeasible logic is Stable, J.Logic and Computation, (3): 379-400.

    Google Scholar 

  4. Billington D (1997) Conflicting literals and defeasible logic. In: Nayak A, Pag-nucco M (eds) Proc. 2nd Australian Workshop Commonsense Reasoning, 1 December, Perth, Western Australia, The Australian Computer Society: 1-15.

    Google Scholar 

  5. Blair HA, Subrahmanian VS (1989) Paraconsistent logic programming. Theoretical Computer Science, 68: 135-154.

    Article  MATH  MathSciNet  Google Scholar 

  6. da Costa NCA, Subrahmanian VS, Vago C (1989) The paraconsistent logics PT. Zeitschrift für Mathematische Logic und Grundlangen der Mathematik, 37: 139-148.

    Article  MathSciNet  Google Scholar 

  7. Dressler O (1988) An extended basic ATMS. In: Reinfrank M, et al. (eds) Proc. 2nd Intl. Workshop Non-monotonic Reasoning, 13-15 June, Grassau, Germany. Lecture Notes in Computer Science LNCS 346, Springer-Verlag, Berlin: 143-154.

    Google Scholar 

  8. Fitting M (1991) Bilattice and the semantics of logic programming. J. Logic Programming, 11: 91-116.

    Article  MATH  MathSciNet  Google Scholar 

  9. Geerts P, Laenens F, Vermeir D (1998) Defeasible logics In: Gabbay DM, Smets PH (eds) Handbook of Defeasible Reasoning and Uncertainity Management Systems 2. Kluwer Academic Publishers, The Netherlands: 175-210.

    Google Scholar 

  10. Gelfond M, Lifschitz V (1989) The stable model semantics for logic program-ming. In: Kowalsky RA, Bowen KA (eds) Proc. 5th Intl. Conf. and Symp. Logic Programming (ICLP/SLPSS), 15-19 August, Seattle, WA, MIT Press, Cambridge, MA: 1070-1080.

    Google Scholar 

  11. Gelder AV, Ross KA, Schlipf JS (1991) The well-founded semantics for general logic programs. J. ACM, 38: 620-650.

    MATH  Google Scholar 

  12. Gordon MJC, Melham TF (1993) Introduction to HOL. Cambridge University Press, UK.

    MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  14. Kifer M, Subrahmanian VS (1992) Theory of generalized annotated logic programming and its applications. J. Logic Programming, 12: 335-368.

    Article  MathSciNet  Google Scholar 

  15. Lloyd JW (1987) Foundations of Logic Programming (2nd ed). Springer-Verlag, Berlin.

    MATH  Google Scholar 

  16. Meyer J-JC, Wiering RJ (eds) Deontic Logic in Computer Science. Wiley, Chichester, UK.

    Google Scholar 

  17. McNamara P, Prakken H (eds) (1999) Norms, Logics and Information Systems (New Studies in Deontic Logic and Computer Science, Frontiers in Artificial Intelligence and Applications 49). IOS Press, The Netherlands.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  19. Morley JM (1996) Safety Assurance in Interlocking Design. PhD Thesis, School of Informatics, University of Edinburgh, UK.

    Google Scholar 

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

    Google Scholar 

  21. Nakamatsu K, Suzuki A (1998) 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. Springer-Verlag, Berlin: 79-93.

    Google Scholar 

  22. Nakamatsu K, Abe JM (1999) Reasonings based on vector annotated logic pro-grams. In: Mohammadian M (ed) Computational Intelligence for Modelling, Control & Automation (CIMCA99) (Concurrent Systems Engineering Series 55). IOS Press, The Netherlands: 396-403.

    Google Scholar 

  23. Nakamatsu K, Abe JM, Suzuki A (1999) Defeasible reasoning between conflicting agents based on VALPSN. In: Tessier C, Chaudron L (eds) Proc. AAAI Workshop Agents Conflicts. 18 July, Orlando, FL. AAAI Press, Menlo Park, CA: 20-27.

    Google Scholar 

  24. Nakamatsu K, Abe JM, Suzuki A (1999) Defeasible reasoning based on VALPSN and its application. In: Nayak A, Pagnucco M (eds) Proc.3rd Australian Com-monsense Reasoning Workshop, 7 December, Sydney, Australia, University of Newcastle: 114-130.

    Google Scholar 

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

    MathSciNet  Google Scholar 

  26. Nakamatsu K, Abe JM, Suzuki A (2001) A defeasible deontic reasoning system based on annotated logic programming. In: Dubois DM (ed) Proc. 4th Intl. Conf. Computing Anticipatory Systems (CASYS2000)(AIP Conference Proceedings 573), 7-12 August, Liege, Belgium. American Institute of Physics, New York, NY: 609-620.

    Google Scholar 

  27. Nakamatsu K, Abe JM, uzuki A (2001) Annotated semantics for defeasible deon-tic reasoning. In: Ziarko W, Yao Y (eds) Proc. 2nd Intl. Conf. Rough Sets and Current Trends in Computing (RSCTC2000), 16-19 October, Banff, Canada, (Lecture Notes in Artifiial Intelligence LNAI 2005). Springer-Verlag, Berlin: 432-440.

    Google Scholar 

  28. Nakamatsu K, Abe JM, Suzuki A (2002) 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). Physica-Verlag, Heidelberg, Germany: 665-680.

    Google Scholar 

  29. Nakamatsu K, Suito H, Abe JM, Suzuki A (2002) 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 (SMC02), 6-9 October, Hammamet,Tunisia. IEEE SMC (CD-ROM).

    Google Scholar 

  30. Nakamatsu K, Abe JM, Suzuki A (2002) A railway interlocking safety verifica-tion system based on abductive paraconsistent logic programming. In: Abraham A, et al. (eds) Soft Computing Systems (HIS02) - Frontiers in Artificial Intelligence and Applications 87. IOS Press, The Netherlands: 775-784.

    Google Scholar 

  31. Nakamatsu K, Abe JM, Suzuki A (2002) Defeasible deontic robot control based on extended vector annotated logic programming. In: Dubois DM (ed) Proc. 5th Intl. Conf. Computing Anticipatory Systems (CASYS2001)(AIP Conference Proceedings 627), 13-18 August, Liege, Belgium. American Institute of Physics, New York, NY: 490-500.

    Google Scholar 

  32. Nakamatsu K, Mita Y, Shibata T (2003) 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 (CIMCA2003), 12-14 February, Vienna, Austria. IOS Press, The Netherlands (CD-ROM).

    Google Scholar 

  33. Nakamatsu K, Seno T, Abe JM, 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 (RSFDGr2003), 26-29 May, Chongqing, China. Lecture Notes in Artificial Intelligence LNAI 2639. Springer-Verlag, Berlin: 719-723.

    Google Scholar 

  34. Nakamatsu K, Komaba H, Suzuki A (2004) Defeasible deontic control for discrete events based on EVALPSN. In: Tsumoto S, et al. (eds) Proc. 4th Intl. Conf. Rough Sets and Current Trends in Computing (RSCTC2004), 1-5 June, Uppsala, Sweden, Lecture Notes in Artificial Intelligence LNAI 3066. Springer-Verlag, Berlin: 310-315.

    Google Scholar 

  35. Nakamatsu K, Ishikawa R, Suzuki A (2004) A paraconsistent based control for a discrete event cat and mouse. In: Negoita MG, et al. (eds) Proc. 8th Intl. Conf. Knowledge-Based Intelligent Information and Engineering Systems (KES2004), 20-25 September, Wellington, NZ. Lecture Notes in Artificial Intelligence LNAI 3214, Springer-Verlag, Berlin: 954-960.

    Google Scholar 

  36. Nakamatsu K, Chung S-L, Komaba H, Suzuki A (2005) 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. Springer-Verlag, Berlin: 671-681.

    Google Scholar 

  37. Nakamatsu K, Abe JM, Akama S (2005) An intelligent safety verification based on a paraconsistent logic program. In: Khosla R, et al. (eds) Proc. 9th Intl. Conf. Knowledge-Based Intelligent Information and Engineering Systems (KES2005), 14-16 September, Melbourne, Australia. Lecture Notes in Artificial Intelligence LNAI 3682, Springer-Verlag, Berlin: 708-715.

    Google Scholar 

  38. Nakamatsu K, Kawasumi K, Suzuki A (2005) Intelligent verification for pipeline based on EVALPSN. In: Nakamatsu K, Abe JM (eds) Advances in Logic Based Intelligent Systems, Frontiers in Artificial Intelligence and Applications 132. IOS Press, The Netherlands: 63-70.

    Google Scholar 

  39. Nakamatsu K, Suzuki A (2005) Autoepistemic theory and paraconsistent logic program. In: Nakamatsu K, Abe JM (eds) Advances in Logic Based Intelligent Systems, Frontiers in Artificial Intelligence and Applications 132. IOS Press, The Netherlands: 177-184.

    Google Scholar 

  40. Nakamatsu K, Suzuki A (2005) Annotated semantics for non-monotonic rea-sonings in artificial intelligence - I, II, III, IV. In: Nakamatsu K, Abe JM (eds) Advances in Logic Based Intelligent Systems, Frontiers in Artificial Intelligence and Applications 132. IOS Press, The Netherlands: 185-215.

    Google Scholar 

  41. Nakamatsu K, Mita Y, Shibata T (2007) An intelligent action ontrol sys-tem based on extended vector annotated logic program and its hardware implementation. J. Intelligent Automation and Soft Computing,133: 289-304.

    Google Scholar 

  42. Nute D (1987) Defeasible reasoning. In: Stohr EA, et al. (eds) Proc. 20th Hawaii Intl. Conf. System Science (HICSS87), 6-9 January, Kailua-Kona, Hawaii. University of Hawaii, Hawaii: 470-477.

    Google Scholar 

  43. Nute D (1992) Basic defeasible logics. In: del Cerro LF, Penttonen M (eds) Intensional Logics for Programming. Oxford University Press, UK: 125-154.

    Google Scholar 

  44. Nute D (1994) Defeasible logic In: Gabbay DM, et al. (eds) Handbook of Logic in Artificial Intelligence and Logic Programming 3. Oxford University Press, UK: 353-396.

    Google Scholar 

  45. Nute D (1997) Apparent obligatory. In: Nute D (ed) Defeasible Deontic Logic, Synthese Library 263, Kluwer Academic Publishers, The Netherlands: 287-316.

    Google Scholar 

  46. Prakken H (1997) Logical tools for modelling legal argument. Law and Philosophy Library 32. Kluwer Academic Publishers, The Netherlands.

    Google Scholar 

  47. Przymusinski TC (1988) On the declarative semantics of deductive databases and logic programs. In: Minker J (ed) Foundation of Deductive Database and Logic Programs Morgan Kaufmann: 193-216.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  49. Shepherdson JC (1998) Negation as failure, completion and stratification. In: Gabbay DM, et al. (eds) Handbook of Logic in Artificial Intelligence and Logic Programming 5, Oxford University Press, UK: 356-419.

    Google Scholar 

  50. Subrahmanian VS(1994) Amalgamating knowledge bases. ACM Trans. Database Systems, 19: 291-331.

    Article  MathSciNet  Google Scholar 

  51. Subrahmanian VS (1987) On the semantics of qualitative logic programs. In: Proc. 4th IEEE Symp. Logic Programming (SLP87), 31 August - 4 September, IEEE Computer Society Press, San Francisco, CA: 178-182.

    Google Scholar 

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

    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

Authors
  1. Kazumi Nakamatsu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science and Software Engineering Faculty of Informatics, University of Wollongong, Northfields Ave, Wollongong, NSW, 2522, Australia

    John Fulcher

  2. Knowledge-Based Engineering Founding Director of the KES Centre, University of South Australia, SCT-Building Mawson Lakes Campus, Adelaide, South Australia SA, 5095, Australia

    L. C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Nakamatsu, K. (2008). The Paraconsistent Annotated Logic Program EVALPSN and its Application. In: Fulcher, J., Jain, L.C. (eds) Computational Intelligence: A Compendium. Studies in Computational Intelligence, vol 115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78293-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78293-3_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78292-6

  • Online ISBN: 978-3-540-78293-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation