Novelty in deductive databases

Journal of Logic and Computation

Volumn 6, Issue 5, 1996, Pages 683-708

  Grégoire, Eric ^a   Marquis, Pierre ^b  

^a UNIVERSITÉ D'ARTOIS   (France)

^b INRIA   (France)

Author keywords

Deductive databases; Non monotonic logics; Novelty; Relevance

Indexed keywords

EID: 0010317074     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/6.5.683     Document Type: Article

References (28)

1. S. Buvač, V. Buvač and I. A. Mason. Metamathematics of contexts. Fundameta Informatiœ, 23, 263-301, 1995.
2. K. L. Clark. Negation as failure. In Logic and Databases, H. Gallaire and J. Minker, eds. pp. 293-322. Plenum Press, New York, 1978.
3. S. Cazalens, R. Demolombe and A. J. Jones. A logic for reasoning about "is-about" (extended abstract). Technical report ONERA/CERT, Toulouse, 1992.
4. F. Cuppens and R. Demolombe. How to recognize interesting topics to provide cooperative answers. Information Systems, 14, 163-173, 1989.
5. J. De Kleer. An improved incremental algorithm for generating prime implicates. In Proceedings of the 10th National Conference on Artificial Intelligence (AAAI-92), San Jose (CA), pp. 780-785, 1992.
6. R. Demolombe. Syntactical characterization of a subset of domain-independent formulas. Journal of the Assodation for Computing Machinery, 39, 71-94, 1992.
7. R. Demolombe and A. Jones. Reasoning about topics: towards a formal theory. In Proceedings of the AAAI Symposium, Workshop on Formalizing Contexts, Boston, MA, 1995.
8. H. B. Enderton. A Mathematical Introduction to Logic. Academic Press, San Diego, 1972.
9. R. L. Epstein. The Semantic Foundations of Logic. Volume 1: Propositional Logic, Kluwer Academic, 1990.
10. N. Goodman. About, Mind, 70, 1961.
11. R. Greiner and M. R. Genesereth. What's new? a semantic definition of novelty. In Proceedings of the 8th International Joint Conference on Artificial Intelligence (UCAI-83), Karlsruhe, pp. 450-454, 1983.
12. P. Jackson and J. Pais. Computing prime implicants. In Proceedings of the 10th International Conference on Automated Deduction (CADE-90), Kaiserslautern, pp. 543-557. Vol. 449 of Lecture Notes in Artificial Intelligence, Springer-Verlag, 1990.
13. P. Jackson. Computing prime implicates incrementally. In Proceedings of the11th International Conference on Automated Deduction (CADE-92). Saratoga Springs, NY, pp. 253-267. Vol 607 of Lecture Notes in Artificial Intelligence, Springer-Verlag, 1992.
14. A. Kean and G. Tsiknis. An incremental method for generating prime implicants/implicates. Journal of Symbolic Computation, 9, 185-206, 1990.
15. G. Lakemeyer. All they know about. In Proceedings of the 11th National Conference on Artificial Intelligence (AAAI-93), Seattle, WA, pp. 662-667. 1993.
16. J. C. Madre and O. Coudert. A logically complete reasoning maintenance system based on a logical constraint solver. In Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI-91), Sydney, pp. 294-299, 1991.
17. P. Marquis. Contribution à l'étude des méthodes de construction d'hypothèses en intelligence artificielle. Doctoral dissertation. Université de Nancy I, 1991.
18. P. Marquis.Extending abduction from prepositional to first-order logic. In Proceedings of the 1st International Workshop on Fundamentals of Artificial Intelligence (FAIR-91), Bratislava, pp. 141-155. Vol 535 of Lecture Notes in Artificial Intelligence, Springer-Verlag, 1991.
19. P. Marquis. Novelty revisited. In Proceedings of the 6th International Symposium on Methodologies for Intelligent Systems (ISMIS-91), Charlotte, NC. pp. 550-559. Vol. 542 of Lecture Notes in Artificial Intelligence, Springer-Verlag, 1991.
20. J. McCarthy. Applications of circumscription to formalizing common-sense knowledge. Artificial Intelligence, 28, 27-39, 1986.
21. J. Minker. On indefinite databases and the closed-world assumption. In Proceedings of the 6th Conference on Automated Deduction (CADE-82), New York, pp. 292-308. Vol. 138 of Lecture Notes in Computer Science, Springer-Verlag, 1982.
22. J.-M. Nicolas. Logic for improving integrity checking in relational databases. Acta Informatica, 18, 227-253, 1982.
23. W. V. Quine. On cores and prime implicants of truth functions. American Mathematical Monthly, 66, 755-760, 1959.
24. R. Reiter. On closed-world databases. In Logic and Databases, H. Gallaire and J. Minker, eds. pp. 55-76. Plenum Press, New York, 1978.
25. J. A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the Association for Computing Machinery,12, 23-41, 1965.
26. J. R. Slagle, C. L. Chang and R. C. T. Lee. A new algorithm for generating prime implicants. IEEE Transactions on Computers, 19, 304-310, 1970.
27. A. Thayse (ed.). From Standard Logic to Logic Programming. Wiley, London, 1988.
28. A. Thayse (ed.). From Modal Logic to Deductive Databases. Wiley, London, 1989.