Tractable cover compilations

IJCAI International Joint Conference on Artificial Intelligence

Volumn 1, Issue , 1997, Pages 122-127

  Boufkhad, Yacine ^a   Gregoire, Eric ^b   Marquis, Pierre ^b   Mazure, Bertrand ^b   Sais, Lakhdar ^b  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^b UNIVERSITÉ D'ARTOIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

HORN FORMULAS; KNOWLEDGE BASE; KNOWLEDGE BASIS; NEW APPROACHES; PRIME IMPLICANTS; QUERY ANSWERING; SPACE SAVINGS;

ARTIFICIAL INTELLIGENCE;

KNOWLEDGE BASED SYSTEMS;

EID: 0002685549     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. E. Boros, P.L. Hammer, and X. Sun. Recognition of q-horn formulae in linear time. Discrete Applied Mathematics, 55(1):1-13, 1994.
2. Y. Boufkhad and O. Dubois. Length of prime implicants and number of solutions of random r-cnf formulas, (submitted), 1996.
3. T. Castell and M. Cayrol. Computation of prime implicates and prime implicants by the davis and putnam procedure. In Proc. ECAi'96 Workshop on Advances in Propositional Deduction, pages 61-64, Budapest, 1996.
4. R. Dechter and I. Rish. Directional resolution: The davis-putnam procedure, revisited. In Proc. KR'94, pages 134-145, Bonn, 1994.
5. A. del Val. Tractable databases: How to make propositional unit resolution complete through compilation. In Proc. KR'94, pages 551-561,1994.
6. A. del Val. An analysis of approximate knowledge compilation. In Proc. IJCAi'95, pages 830-836, Montreal, 1995.
7. A. del Val. Approximate knowledge compilation: The first-order case. In Proc. AAAi'96, pages 498-503, Portland (OR), 1996.
8. W. Dowling and J. Gallier. Linear time algorithms for testing the satisfiability of propositional horn formulae. Journal of Logic Programming, I(3):267-284, 1984. (Pubitemid 15564552)
9. ndDIM ACS Implementation Challenge, volume 26 of DIM ACS Series, pages 415-436. American Mathematical Society, 1996.
10. K.D. Forbus and J. DeKleer. Building Problem Solvers. MIT Press, 1993.
11. R. Khardon and D. Roth. Reasoning with models. Artificial Intelligence, 87:187-213, 1996. (Pubitemid 126371219)
12. D.E. Knuth. Nested satisfiability. Acta Informatica, 28:1-6, 1990.
13. H.R. Lewis. Renaming a set of clauses as a horn set. JACM, 25:134-135,1978.
14. P. Marquis and S. Sadaoui. A new algorithm for computing theory prime implicates compilations. In Proc. AAAI'96, pages 504-509, Portland (OR), 1996.
15. P. Marquis. Knowledge compilation using theory prime implicates. In Proc. IJCAI'95, pages 837-843, Montreal, 1995.
16. R. Reiter and J. De Kleer. Foundations of assumption-based truth maintenance systems: Preliminary report. In Proc. AAAI'87, pages 183-188, Seattle (WA), 1987.
17. R. Schrag. Compilation for critically constrained knowledge bases. In Proc. AAAI'96, pages 510-515, Portland (OR), 1996.
18. B. Selman and H. Kautz. Knowledge compilation using horn approximations. In Proc. AAAI'91, pages 904-909,1991.
19. B. Selman and H. Kautz. Knowledge compilation and theory approximation. JACM, 43(2):193-224, 1994. (Pubitemid 126628034)