Compiling propositional weighted bases

Artificial Intelligence

Volumn 157, Issue 1-2, 2004, Pages 81-113

  Darwiche, Adnan ^a   Marquis, Pierre ^b  

^a University of California   (United States)

^b UNIVERSITÉ D'ARTOIS   (France)

Author keywords

Belief bases; Knowledge compilation; Knowledge representation; Penalty logic

Indexed keywords

ARTIFICIAL INTELLIGENCE; FUNCTIONS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; QUERY LANGUAGES; SET THEORY;

BELIEF BASES; KNOWLEDGE COMPILATION; PENALTY LOGICS; WEIGHT FUNCTION;

KNOWLEDGE ENGINEERING;

EID: 2942691592     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2004.04.005     Document Type: Article

References (54)

1. Amir E., McIlraith S. Partition-based logical reasoning. Proc. of the 7th International Conference on Knowledge Representation and Reasoning (KR-00), Breckenridge, CO. 2000;389-400.
2. Benferhat S., Cayrol C., Dubois D., Lang J., Prade H. Inconsistency management and prioritized syntax-based entailment. Proc. IJCAI-93, Chambéry, France. 1993;640-645.
3. Benferhat S., Dubois D., Lang J., Prade H., Saffiotti A., Smets P. A general approach for inconsistency handling and merging information in prioritized knowledge bases. Proc. of the 6th International Conference on Knowledge Representation and Reasoning (KR-98), Trento, Italy. 1998;466-477.
4. Benferhat S., Dubois D., Prade H. How to infer from inconsistent beliefs without revising. Proc. IJCAI'95, Montreal, Quebec. 1995;1449-1455.
5. Benferhat S., Kaci S., Le Berre D., Williams M.-A. Weakening conflicting information for iterated revision and knowledge integration. Proc. IJCAI'99, Seattle, WA. 2001;109-115.
6. Borchers B., Furman J. A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems. J. Combin. Optim. 2:(4):1999;299-306.
7. Boufkhad Y., Grégoire E., Marquis P., Mazure B., Saïs L. Tractable cover compilations. Proc. IJCAI'97, Nagoya, Japan. 1997;122-127.
8. Cadoli M., Donini F.M. A survey on knowledge compilation. AI Comm. 10:1997;137-150. (printed in 1998).
9. Cadoli M., Donini F.M., Liberatore P., Schaerf M. The size of a revised knowledge base. Artificial Intelligence. 115:(1):1999;25-64.
10. Cadoli M., Donini F.M., Liberatore P., Schaerf M. Space efficiency of propositional knowledge representation formalisms. J. Artificial Intelligence Res. 13:2000;1-31.
11. Cadoli M., Donini F.M., Liberatore P., Schaerf M. Preprocessing of intractable problems. Inform. and Comput. 176:(2):2002;89-120.
12. Cadoli M., Donini F.M., Schaerf M. Is intractability of non-monotonic reasoning a real drawback? Artificial Intelligence. 88:1996;215-251.
13. Cadoli M., Donini F.M., Schaerf M., Silvestri R. On compact representations of propositional circumscription. Theoret. Comput. Sci. 182:1997;183-202.
14. Cayrol C., Lagasquie-Schiex M.-C., Schiex Th. Nonmonotonic reasoning: From complexity to algorithms. Ann. Math. Artificial Intelligence. 22:(3-4):1998;207-236.
15. Coste-Marquis S., Marquis P. Compiling stratified belief bases. Proc. of the 14th European Conference on Artificial Intelligence (ECAI-00), Berlin. 2000;23-27.
16. Dalal M. Semantics of an anytime family of reasoners. Proc. of the 12th European Conference on Artificial Intelligence (ECAI-96), Budapest. 1996;360-364.
17. A. Darwiche, A symbolic generalization of probability theory, Ph.D. Thesis, Stanford University, 1992.
18. Darwiche A. Compiling devices: A structure-based approach. Proc. of the 6th International Conference on Knowledge Representation and Reasoning (KR-98), Trento, Italy. 1998;156-166.
19. Darwiche A. Compiling knowledge into decomposable negation normal form. Proc. IJCAI-99, Stockholm, Sweden. 1999;284-289.
20. Darwiche A. Decomposable negation normal form. J. ACM. 48:(4):2001;608-647.
21. Darwiche A. On the tractability of counting theory models and its application to belief revision and truth maintenance. J. Appl. Non-Classical Logics. 11:(1-2):2001;11-34.
22. Darwiche A. A compiler for deterministic decomposable negation normal form. Proc. AAAI-02, Edmonton, AB. 2002;627-634.
23. Darwiche A., Goldszmidt M. On the relation between kappa calculus and probabilistic reasoning. Proc. of the 10th Conference on Uncertainty in Artificial Intelligence (UAI-94), San Francisco, CA. 1994;145-153.
24. Darwiche A., Marquis P. A perspective on knowledge compilation. Proc. IJCAI-99, Seattle, WA. 2001;175-182.
25. Darwiche A., Marquis P. A knowledge compilation map. J. Artificial Intelligence Res. 17:2002;229-264.
26. F. Dupin de St Cyr, Gestion de l'évolutif et de l'incertain en logiques pondérées, Ph.D. Thesis, Université Paul Sabatier, 1996.
27. Dupin de St Cyr F., Lang J., Schiex Th. Penalty logic ans its link with Dempster-Shafer theory. Proc. of the 10th Conference on Uncertainty in Artificial Intelligence (UAI-94), San Francisco, CA. 1994;204-211.
28. Dechter R., Pearl J. Tree clustering for constraint networks. Artificial Intelligence. 38:(3):1989;353-366.
29. Dechter R., Rish I. Directional resolution: The Davis-Putnam procedure, revisited. Proc. of the 4th International Conference on Knowledge Representation and Reasoning (KR-94), Bonn, Germany. 1994;134-145.
30. del Val A. Tractable databases: how to make propositional unit resolution complete through compilation. Proc. of the 4th International Conference on Knowledge Representation and Reasoning (KR-94), Bonn, Germany. 1994;551-561.
31. Eiter Th., Lukasiewicz Th. Default reasoning from conditional knowledge bases: Complexity and tractable cases. Artificial Intelligence. 124:(2):2000;169-241.
32. M. Goldszmidt, Qualitative probabilities: A normative framework for commonsense reasoning, Technical Report R-190, University of California at Los Angeles, Ph.D. Thesis, 1992.
33. Hansen P., Jaumard B. Algorithms for the maximum satisfiability problem. Computing. 44:1990;279-303.
34. Kohlas J., Shenoy P.P. Computation in valuation algebras. Algorithms for Uncertain and Defeasible Reasoning. Handbook of Defeasible Reasoning and Uncertainty Management Systems. vol. 5:2000;5-39 Kluwer Academic, Dordrecht.
35. Lafage C., Lang J. Logical representation of preferences for group decision making. Proc. of the 7th International Conference on Knowledge Representation and Reasoning (KR-00), Breckenridge, CO. 2000;457-468.
36. Lang J., Marquis P. Complexity results for independence and definability in propositional logic. Proc. of the 6th International Conference on Knowledge Representation and Reasoning (KR-98), Trento, Italy. 1998;356-367.
37. Liberatore P. Monotonic reductions, representative equivalence, and compilation of intractable problems. J. ACM. 48:(6):2001;1091-1125.
38. Liberatore P., Schaerf M. Relating belief revision to circumscription (and vice versa). Artificial Intelligence. 93:(1-2):1997;261-296.
39. Marquis P. Knowledge compilation using theory prime implicates. Proc. IJCAI-95, Montreal, Quebec. 1995;837-843.
40. Moinard Y. Note about cardinality-based circumscription. Artificial Intelligence. 119:2000;259-273.
41. Nebel B. Belief revision. Handbook of Defeasible Reasoning and Uncertainty Management Systems. vol. 3:1998;77-145 Kluwer Academic, Dordrecht. Chapter: How hard is it to revise a belief base?
42. Papadimitriou Ch. Computational complexity. 1994;Addison-Wesley, Reading, MA.
43. Pargamin B. Vehicle sales configuration: the cluster tree approach. Proc. of the ECAI-02 Workshop on Configuration, Lyon. 2002.
44. Pargamin B. Extending cluster tree compilation with non-boolean variables in product configuration: A tractable approach to preference-based configuration. Proc. of the IJCAI-03 Workshop on Configuration, Acapulco, Mexico. 2003.
45. Pinkas G. Propositional nonmonotonic reasoning and inconsistency in symmetric neural networks. Proc. IJCAI-91, Sydney, Australia. 1991;525-530.
46. Pinkas G. Reasoning, nonmonotonicity and learning in connectionnist networks that capture propositional knowledge. Artificial Intelligence. 77:1995;203-247.
47. Pinkas G., Loui R.P. Reasoning from inconsistency: a taxonomy of principles for resolving conflict. Proc. of the 3rd International Conference on Knowledge Representation and Reasoning (KR-92), Cambridge, MA. 1992;709-719.
48. Reiter R. A theory of diagnosis from first principles. Artificial Intelligence. 32:1987;57-95.
49. Reiter R., de Kleer J. Foundations of assumption-based truth maintenance systems: Preliminary report. Proc. AAAI-87, Seattle, WA. 1987;183-188.
50. Schrag R. Compilation for critically constrained knowledge bases. Proc. AAAI-96, Portland, OR. 1996;510-515.
51. Selman B., Kautz H.A. Knowledge compilation and theory approximation. J. ACM. 43:1996;193-224.
52. Shang Y., Wah B.W. Discrete Lagrangian-based search for solving MAX-SAT problems. Proc. IJCAI-97, Nagoya, Japan. 1997;377-383.
53. Spohn W. Ordinal conditional functions: A dynamic theory of epistemic states. Harper W.L., Skyrms B. Causation in Decision, Belief Change, and Statistics, vol. 2. 1987;105-134.
54. Wegener I. The Complexity of Boolean Functions. 1987;Wiley-Teubner, Stuttgart.