Skip Navigation



Journal of Logic and Computation Advance Access published online on May 9, 2008
Journal of Logic and Computation, doi:10.1093/logcom/exn015
This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Galindo, M. O.
Right arrow Articles by Carballido, J. L.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2008. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Original Papers

Logical Weak Completions of Paraconsistent Logics

Mauricio Osorio Galindo

Universidad de las Américas – Puebla E-mail: osoriomauri{at}gmail.com

José R. Arrazola Ramírez and José Luis Carballido

Benemérita Universidad Autónoma de Puebla, Mathematics Department E-mail: arrazola{at}fcfm.buap.mx, carballido{at}fcfm.buap.mx

Received 25 March 2008.

Let P be an arbitrary theory and let X be any given logic. Let M be a set of atoms. We say that M is a X-stable model of P if M is a classical model of P and P{cup}¬Formula proves in logic X all atoms in M, this is denoted by P{cup}¬Formula {Vdash}xM. We prove that being an X-stable model is an invariant property for disjunctive programmes under a large class of logics. Two kinds of logics are mainly considered: paraconsistent logics and normal modal logics. For modal logics we use a translation proposed by Gelfond that replaces ¬a with ¬{square}a. As a consequence we prove that several semantics (recently introduced) for non-monotonic reasoning are equivalent for disjunctive programmes. In addition, we show that such semantics can be characterized by a fixed-point operator in terms of classical logic. We also present a simple translation of a disjunctive programme D into a normal programme N, such that the PStable model semantics of N corresponds to the stable semantics of D over the common language. We present the formal proof of this statement.

Keywords: Paraconsistent logics; multivalued logics; non-monotonic semantics; stable semantics



References

  1. Avron A. Natural 3-valued logics – characterization and proof theory. The Journal of Symbolic Logic (1991) 56(1):276–294.[CrossRef]
  2. Baral C, Gelfond M. Logic programming and knowledge representation. Journal of Logic and Programming (1994) 19(20):73–148.[CrossRef]
  3. Belnap ND. A useful four-valued logic. In: Modern Uses of Multiple-Valued Logics—Dunn JM, Epstein G, eds. (1977) Dordrecht: D. Reidel. 8–37.
  4. Béziau J. The paraconsistent logic Formula . Journal of Logical Philosophy (2006) 15:99–111.
  5. Carballido JL, Osorio M, Arrazola J. Equivalence for the G'3-stable models semantics. In: Proceedings of the LA-NMR, CEUR-WS.org (2007) Technical University of Aachen (RWTH).
  6. Carnielli WA, Marcos J. A taxonomy of C-Systems. In: Paraconsistency: The Logical Way to the Inconsistent, Proceedings of the Second World Congress on Paraconsistency (WCP 2000), Vol. 228 in Lecture Notes in Pure and Applied Mathematics (2002) New York: Marcel Dekker, Inc. 1–94.
  7. da Costa NCA. On the Theory of Inconsistent Formal Systems (in Portuguese). (1963) Curitiva: Editora UFPR, Brazil. PhD thesis.
  8. de Jongh D, Hendriks L. Characterization of strongly equivalent logic programs in intermediate logics. Theory and Practice of Logic Programming (2003) 3(3):259–270.[CrossRef][ISI]
  9. Donini FM, Nardi D, Rosati R. Ground non-monotonic modal logics. Logic and Computation (1997) 7(4).
  10. Eén N, Sörensson N. An Extensible SAT-solver. In: Vol. 2919 of Lecture Notes in Computer Science (2004) Berlin: Springer. 502–518.
  11. Erdogan ST, Lifschitz V. Definitions in answer set programming: (extended abstract). In: In Proceedings of the ICLP (2003) Berlin: Springer. 483–484.
  12. Gelfond M. On stratified auto-epistemic theories. In: Proceedings of AAAI (1987) Los Altos, CA: Morgan Kaufman. 207–211.
  13. Gelfond M, Lifschitz V. The stable model semantics for logic programming. In: 5th Conference on Logic Programming—Kowalski R, Bowen K, eds. (1988) Cambridge, MA: MIT Press. 1070–1080.
  14. Gelfond M, Lifschitz V. Logic programs with classical negation. In: Logic Programming, Proceedings of the Seventh International Conference—Warren DHD, Szeredi P, eds. (1990) June. Jerusalem, Israel: MIT Press. 579–597.
  15. Goldblatt R. Logics of Time and Computation. In: Vol. 7 in CSLI Lecture Notes (1992) 2nd edn. Stanford: CSLI (Center for the study of language and information).
  16. Ginsberg ML. On the relation between default and autoepistemic logic. In: Readings in Non-monotonic Reasoning (1987) Los Altos, CA: Kaufmann. 195–226.
  17. Lloyd JW. Foundations of Logic Programming. (1987) 2nd edn. Berlin: Springer.
  18. López A. Implementing PStable. In: Proceedings of the WS of Logic, Language and Computation, CEUR Vol-220, CEUR-WS.org (2006) Technical University of Aachen (RWTH).
  19. McDermott D. Non-monotonic logic II: non-monotonic modal theories. ACM Transactions on Computer Systems (1982) 29:33–57.
  20. McDermott D, Doyle J. Non-monotonic logic I. Artificial Intelligence (1980) 13:41–72.[CrossRef][ISI]
  21. Mendelson E. Introduction to Mathematical Logic. (1987) 3rd edn. Belmont, CA: Wadsworth.
  22. Osorio M. GLukG logic and its application for non-monotonic reasoning. In: In Proceedings of the LA-NMR, CEUR-WS.org (2007) Technical University of Aachen (RWTH).
  23. Osorio M, Carballido JL. Brief study of G'3 logic. Journal of Applied Non-Classical Logics (2008) 18(4).
  24. Osorio M, Navarro JA. Modal logic S52 and FOUR (abstract). In: proceedings of the 2003 Annual Meeting of the Association for Symbolic Logic (2003) June. Chicago: Association for Symbolic Logic.
  25. Osorio M, Navarro JA, Arrazola J. Equivalence in answer set programming. In: Logic Based Program Synthesis and Transformation—Pettorossi A, ed. (2001) Springer: Paphos, Cyprus. 57–75. 11th International Workshop, LOPSTR 2001, Vol. 2372 in Lecture Notes in Computer Science.
  26. Osorio M, Navarro JA, Arrazola J. A logical approach for A-Prolog. In: 9th Workshop on Logic, Language, Information and Computation (WoLLIC)—de Queiroz R, Pereira LC, Haeusler EH, eds. (2002) Rio de Janeiro, Brazil: Elsevier Science Publishers. 265–275. Vol. 67 of Electronic Notes in Theoretical Computer Science.
  27. Osorio M, Borja V, Arrazola J. Closing the gap between the stable semantics and extensions of WFS. In: Mexican International Conference on Artificial Intelligence (2004) Berlin: Springer. 202–211. Vol. 2972 in Lecture Notes in Computer Science.
  28. Osorio M, Navarro JA, Arrazola J. Applications of intuitionistic logic in answer set programming. Theory and Practice of Logic Programming (2004) 4(3):325–354.[CrossRef][ISI]
  29. Osorio M, Navarro JA, Arrazola J, Borja V. Ground non-monotonic modal logic S5: new results. Journal of Logic and Computation (2005) 15(5):787–813.[Abstract/Free Full Text]
  30. Osorio M, Arrazola J, Carballido JL, Estrada O. An axiomatization of G'3. In: Proceedings of the WS of Logic, Language and Computation, CEUR Vol-220, CEUR-WS.org (2006) Technical University of Aachen (RWTH).
  31. Osorio M, Arrazola J, Carballido JL, Estrada O. Programas logicos disyuntivos y la demostrabilidad de atomos en C{omega}. In: Proceedings of the WS of Logic, Language and Computation, CEUR Vol-220, CEUR-WS.org (2006) Technical University of Aachen (RWTH).
  32. Osorio M, Navarro JA, Arrazola J, Borja V. Logics with common weak completions. Journal of Logic and Computation (2006) 16(6):867–890.[Abstract/Free Full Text]
  33. Pearce D. Stable inference as intuitionistic validity. Logic Programming (1999) 38:79–91.[CrossRef]

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?



This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Galindo, M. O.
Right arrow Articles by Carballido, J. L.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?