Nonmonotonic logic for use in information retrieval: An exploratory paper

Information Processing and Management

Volumn 34, Issue 1, 1998, Pages 35-41

  Hurt, C D ^a  

^a UNIVERSITY OF ARIZONA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; FORMAL LOGIC; MATHEMATICAL MODELS; NEURAL NETWORKS;

INFORMATION SEARCHING; NONMONOTONIC LOGIC;

ONLINE SEARCHING;

EID: 0031643260     PISSN: 03064573     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0306-4573(97)00036-8     Document Type: Article

References (14)

1. Antoniou, G. (1996). Operational characterizations of extensions in some logics for default reasoning. Information Sciences, 89, 261-273.
2. Apt, K. R., & van Emden, M. H. (1982). Contributions to the theory of logic programming. Journal of the ACM, 29, 841-862.
3. Beringer, A. & Schaub, T. (1993) Minimal belief and negation as failure: a feasible approach, Proceedings of the National Conference on Artificial Intelligence, Menlo Park, CA: AAAI.
4. Cadoli, M., & Lenzerini, M. (1994). Complexity of propositional closed world reasoning and circumscription. Journal of Computer and System Sciences, 48, 255-310.
5. Chang, C. & Lee, R. (1973) Symbolic logic and mechanical theorem proving, New York: Academic Press.
6. Clark, K. L. (1978) Negation as failure. In H. Gallaire & J. Minker (Ed.), Logic and databases, New York: Plenum.
7. Darwiche, A. & Pearl, J. (1994) Symbolic causal networks, Proceedings of the 12th National Conference on Artificial Intelligence, Menlo Park, CA: AAAI.
8. Etherington, D. W. (1987). Formalizing nonmonotonic reasoning systems. Artificial Intelligence, 31, 41-85.
9. McDermott, D., & Doyle, J. (1980). Nonmonotonic logic I. Artificial Intelligence, 13, 27-39.
10. McDermott, D., & Doyle, J. (1982). Nonmonotonic logic II. Journal of the ACM, 29, 33-57.
11. Narayanan, A. (1996). Revisable knowledge discovery in databases. International Journal of Intelligent Systems, 11, 75-96.
12. Reiter, R. (1980). A logic for default reasoning. Artificial Intelligence, 13, 81-132.
13. Subrahmanian, V. S., Nau, D., & Vago, C. (1995). WFS plus branch and bound equals stable models. IEEE Transactions on Knowledge and Data Engineering, 7, 362-377.
14. Tarski, A. (1955). A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5, 285-309.