A logic for anytime deduction and anytime compilation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1489, Issue , 1998, Pages 324-342

  Koriche, Frédéric ^a  

^a LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; ECONOMIC AND SOCIAL EFFECTS; KNOWLEDGE BASED SYSTEMS;

REASONING TASKS; SPACE COMPLEXITY; STEPWISE PROCEDURE; TIME COMPLEXITY; TRADE OFF;

COMPUTER CIRCUITS;

EID: 84937424643     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49545-2_22     Document Type: Conference Paper

References (24)

1. N. D. Belnap. A useful four-valued logic. In J. M. Dunn and G. Epstein, editors, Modern Uses of Multiple-Valued Logic, pages 8-37. Reidel, Dordrecht, 1977.
2. M. Cadoli. Tractable reasoning in artificial intelligence, volume 941 of Lecture Notes in Artificial Intelligence. Springer-Verlag Inc., New York, NY, USA, 1995.
3. M. Cadoli and M. Schaerf. Approximate inference in default reasoning and circumscription. In B. Neumann, editor, Proceedings 10th European Conference on Artificial Intelligence, pages 319-323, Vienna, Austria, 1992. John Wiley & Sons.
4. A. Chandra and G. Markowsky. On the number of prime implicants. Discrete Mathematics, 24:7-11, 1978.
5. M. Dalal. Semantics of an anytime family of reasoners. In W. Wahlster, editor, Proceedings of the 12th European Conference on Artificial Intelligence (ECAI-96), pages 360-364. Wiley & Sons, 1996.
6. R. Dechter and I. Rish. Directional resolution: The davis-putnam procedure, revisited. In P. Torasso, J. Doyle, and E. Sandewall, editors, Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning, pages 134-145, Bonn, Germany, 1994. Morgan Kaufmann.
7. A. del Val. Tractable databases: How to make propositional unit resolution complete through compilation. In J. Doyle, E. Sandewall, and P. Torasso, editors, Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning, pages 551-561, Bonn, 1994. Morgan Kaufmann.
8. J. M. Dunn. Intuitive semantics for first-degree entailments and coupled trees. Philosophical Studies, 29:149-168, 1976.
9. F. Koriche. Approximate reasoning about combined knowledge. In M. P. Singh, A. S. Rao, and M. J. Wooldridge, editors, Intelligent Agents Volume IV, volume 1365 of Lecture Notes in Artificial Intelligence, pages 259-273. Springer Verlag, Berlin, Germany, 1998.
10. F. Koriche. Approximate Reasoning in Cooperating Knowledge Based Systems. PhD thesis, Universite de Monptellier II, Montpellier, France, January 1998.
11. H. J. Levesque. Foundations of a Functional Approach to Knowledge Representation. Artificial Intelligence, 23:125-212, 1984.
12. H. J. Levesque. A logic of implicit and explicit belief. In R. J. Brachman, editor, Proceedings of the 6th National Conference on Artificial Intelligence, pages 198-202, Austin, Texas, 1984. William Kaufmann.
13. P. Marquis. Knowledge compilation using theory prime implicates. In Proceedings of the 14th International Joint Conference on Artificial Intelligence,volume 2, pages 837-843, Toronto, Canada, 1995. Morgan Kaufmann.
14. J. McCarthy. Programs with common sense. In Proceedings of the Symposium on Mechanisation of Thought Processes, volume 1, pages 77-84, London, 1958. Her Majesty's Stationery Office.
15. T. Ngair. A new algorithm for incremental prime implicate generation. In Proceedings 13th International Joint Conference on Artificial Intelligence, volume 1, pages 46-51, Chambery, France, aug 1993. Morgan Kaufmann.
16. R. Reiter and J. de Kleer. Foundations of assumption-based truth maintenance systems: Preliminary report. In K. Forbus and H. Shrobe, editors, Proceedings of the 6th National Conference on Artificial Intelligence, pages 183-189, Seattle, (WA) USA, July 1987. Morgan Kaufmann.
17. M. Schaerf and M. Cadoli. Tractable reasoning via approximation. Artificial Intelligence, 74:249-310, 1995.
18. R. Schrag. Compilation for critically constrained knowledge bases. In Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, pages 510-516, Menlo Park (CA) USA, August 1996. AAAI Press/MIT Press.
19. R. Schrag and J. Crawford. Implicates and prime implicates in random 3-SAT. Artificial Intelligence, 81(1-2):199-222, 1996.
20. B. Selman and H. Kautz. Knowledge compilation and theory approximation. Journal of the ACM, 43(2):193-224, 1996.
21. B. Selman, D. Mitchell, and H. Levesque. Generating hard satisfiability problems. Artificial Intelligence, 81:17-30, 1996.
22. A. ten Teije and F. van Harmelen. Computing approximate diagnoses by using approximate entailment. In L. C. Aiello, J. Doyle, and S. Shapiro, editors, Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning, pages 256-267, San Francisco CA, USA, 1996. Morgan Kaufmann.
23. P. Tison. Generalized consensus theory and application to the minimization of boolean functions. IEEE Transactions on electronic computers, 4:446-456, 1967.
24. S. Zilberstein. Using anytime algorithms in intelligent systems. AI Magazine, 17(3):73-83, 1996.