Skip to main content
SpringerLink
Log in

Facts, arguments, annotations and reasoning

  • Regular Paper
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

Reasoning aboutfacts and reasoning aboutarguments regarding facts are distinct activities, and automated reasoning systems should be able to treat them accordingly. In this work, we discuss one precise sense in which this distinction can be envisaged and suggest the use of Annotated Logics to characterise it.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abe, J. M., “Fundamentos da Lógica Anotada (Foundations of Annotated Logic)” — in portuguese,PhD thesis, Universidade de São Paulo, 1992.

  2. Bell, J. L. and Slomson, A. B.,Models and Ultraproducts: an Introduction, North-Holland Publishing Company, 1971.

  3. Blair, H. A. and Subrahmanian, V. S., “Paraconsistent Logic Programming,”Theoretical Computer Science, 68, pp. 135–154, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  4. Bowen, K. A. and Kowalski, R. A., “Amalgamating Language and Metalanguage in Logic Programming,” inLogic Programming: APIC Studies in Data Processing 16 (Clark, K. L., and Tarnlund, S.-A., eds.), Academic Press, 1982.

  5. Carbogim, D. V., “Programação em Lógica Anotada: Teoria e Aplicações,”Master’s thesis, Instituto de Matemática e Estatística da Universidade de São Paulo, 1996.

  6. Corrêa da Silva, F. S., “On Reasoning With and Reasoning about Uncertainty in AI,” inEuropean Summer Meeting of the Association for Symbolic Logic (abstract published in The Bulletin of Symbolic Logic, 3, 2, pp 255–256), Spain, 1996.

  7. da Costa, N. C. A., Abe, J. M. and Subrahmanian, V. S., “Remarks on Annotated Logic,”Zeitschr. f. Math. Logik und Grundlagen d. Math., 37, pp. 561–570, 1991.

    MATH  Google Scholar 

  8. da Costa, N. C. A., Subrahmanian, V. S., and Vago, C., “The Paraconsistent LogicsP τ ,”Zeitschr. f. Math. Logik und Grundlagen d. Math., 37, pp. 139–148, 1991.

    Article  MATH  Google Scholar 

  9. Fitting, M., “Bilattices and the Semantics of Logic Programming,”The Journal of Logic Programming, 11, pp. 91–116, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  10. Gallier, J., “Constructive Logics. Part II: Linear Logic and Proof Nets,”Technical Report 9, Paris Research Laboratory — Digital Equipment Corporation, May 1991.

  11. Girard, J.-Y., “Linear Logic,”Theoretical Computer Science, 50, pp. 1–102, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  12. Gupta, A. and Belnap, N.,The Revision Theory of Truth, The MIT Press, 1993.

  13. Hofstadter, D.,Godel, Escher, Bach: an Eternal Golden Braid, Basic Books, Inc., 1979.

  14. Kifer, M. and Lozinskii, E. L., “A Logic for Reasoning with Inconsistency,”Journal of Automated Reasoning, 9, pp. 179–215, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  15. Leach, S. M. and Lu, J. J., “Query Processing in Annotated Logic Programming: Theory and Implementation,”Journal of Intelligent Information Systems, pp. 1–28, 1995.

  16. Plato.,The Republic, Viking, 1979.

  17. Russell, B.,History of Western Philosophy, George Allen & Unwin, 1961.

  18. Subrahmanian, V. S., “On the Semantics of Quantitative Logic Programs,” inProc. Fourth IEEE Symposium on Logic Programming, pp. 173–182, San Francisco, September 1987.

  19. Tarski, A., “Truth and Proof,”Scientific American, 220, 6, pp. 63–77, 1969.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Representation and Reasoning, Division of Informatics, University of Edinburgh, 80 South Bridge, EH1 1HN, Edinburgh, Scotland

    Daniela V. Carbogim

  2. Institute of Mathematics and Statistics, University of São Paulo, Rua do Matão 1010, 05508-900, São Paulo, SP, Brazil

    Flávio S. Corrêa Da Silva

Authors
  1. Daniela V. Carbogim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Flávio S. Corrêa Da Silva
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Daniela V. Carbogim.

Additional information

Daniela V. Carbogim.: She got a Bachelor degree in Computer Science in 1994 and a MSc in Applied Mathematics in 1996, both from the University of São Paulo, Brazil. She is now a Ph.D. student at the Division of Informatics at the University of Edinburgh, focusing her research on formal models of argumentation. Other research interests include knowledge representation; logic programming; distributed systems, in particular agent negotiation; and topics related to Artificial Intelligence and education.

Flavio S. Correa da Silva, Ph.D.: He graduated as an industrial engineer in 1984 and obtained an MEng in Transportation Planing in 1989, both from the University of Sao Paulo (Brazil). He obtained a Ph.D. in Artificial Intelligence in 1992 from the University of Edinburgh. His research interests have been directed towards knowledge representation and inference, especially involving uncertainties and paraconsistencies; computational learning theory; intelligent tutoring systems; and more recently, distributed problem solving and foundational issues related to research methodology in Artificial Intelligence. Since 1998 he is coordinator of the research project DECaFf-KB — Distributed Environment for Cooperation among Formalisms for Knowledge-Based Systems with participants from the University of Sao Paulo, State University of Ceara (both in Brazil) and University of Edinburgh (Scotland).

About this article

Cite this article

Carbogim, D.V., Da Silva, F.S.C. Facts, arguments, annotations and reasoning. New Gener Comput 19, 1–22 (2001). https://doi.org/10.1007/BF03037532

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037532

Keywords

Search

Navigation