Facts, arguments, annotations and reasoning

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.

[1]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

[2]  D. Hofstadter,et al.  Godel, Escher, Bach: An Eternal Golden Braid , 1979 .

[3]  Michael Kifer,et al.  RI: a logic for reasoning with inconsistency , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[4]  Melvin Fitting,et al.  Bilattices and the Semantics of Logic Programming , 1991, J. Log. Program..

[5]  Robert A. Kowalski,et al.  Amalgamating language and metalanguage in logic programming , 1982 .

[6]  M. Nivat Fiftieth volume of theoretical computer science , 1988 .

[7]  A. Tarski Truth and proof. , 1969, Scientific American.

[8]  J. Gallier Constructive Logics. Part II: Linear Logic and Proof Nets , 1991 .

[9]  B. Russell History of Western philosophy , 1949 .

[10]  V. S. Subrahmanian,et al.  Paraconsistent Logic Programming , 1987, FSTTCS.

[11]  Michael Kifer,et al.  A logic for reasoning with inconsistency , 1992, Journal of Automated Reasoning.

[12]  James J. Lu,et al.  Query processing in annotated logic programming: Theory and implementation , 2004, Journal of Intelligent Information Systems.

[13]  J. Bell,et al.  Models and ultraproducts , 1971 .

[14]  V. S. Subrahmanian,et al.  The Paraconsistent Logics PJ , 1991, Math. Log. Q..

[15]  John L. Bell,et al.  Models and Ultraproducts: An Introduction. , 1969 .

[16]  V. S. Subrahmanian On the Semantics of Quantitative Logic Programs , 1987, SLP.