Two transformations of clauses into constraints and their properties for cost-based hypothetical reasoning

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

Volumn 2417, Issue , 2002, Pages 118-127

  Matsuo, Yutaka ^a   Ishizuka, Mitsuru ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; LINEAR TRANSFORMATIONS; OPTIMIZATION;

HYPOTHETICAL REASONING; LINEAR INEQUALITIES; MATHEMATICAL OPTIMIZATIONS; TWO WAYS;

MATHEMATICAL TRANSFORMATIONS;

EID: 84947939993     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45683-x_15     Document Type: Conference Paper

References (26)

1. Poole, D.: A methodology for using a default and abductive reasoning system. International Journal of Intelligent Systems 5 (1990) 521–548
2. Kakas, A., Kowalski, R., Toni, F.: The role of abduction in logic programming. In: Handbook of Logic in Artificial Intelligence and Logic Programming. Oxford University Press (1995)
3. Charniak, E., Shimony, S.E.: Cost-based abduction and MAP explanation. Artificial Intelligence 66 (1994) 345–374
4. Santos, E.: A linear constraint satisfaction approach to cost-based abduction. Artificial Intelligence 65 (1994) 1–27
5. Eiter, T., Gottlob, G.: The complexity of logic-based abduction. Journal of the Association for Computing Machinary 42 (1995) 3–42
6. Prendinger, H., Ishizuka, M.: Qualifying the expressivity/efficiency tradeoff: Reformationbased diagnosis. In: Proceedings 16th National Conference on Artificial Intelligence (AAAI– 99). (1999) 416–421
7. Ohsawa, Y., Ishizuka, M.: Networked bubble propagation: A polynomial-time hypothetical reasoning method for computing near-optimal solutions. Artificial Intelligence 91 (1997) 131–154
8. Ishizuka, M., Matsuo, Y.: SL method for computing a near-optimal solution using linear and non-linear programming in cost-based hypothetical reasoning. In: Proceedings 5th Pacific Rim Conference on Artificial Intelligence (PRICAI-98). (1998) 611–625
9. Selman, B., Levesque, H., McAllester, D.: A new method for solving hard satisfiability problems. In: Proceedings 9th National Conference on Artificial Intelligence (AAAI-92). (1992) 440–446
10. Gu, J.: Local search for satisfiability (SAT) problem. IEEE Transactions on Systems, Man, and Cybernetics 23 (1993) 1108–1129
11. Selman, B., Kautz, H., Cohen, B.: Noise strategies for improving local search. In: Proceedings 11th National Conference on Artificial Intelligence (AAAI-94). (1994) 337–343
12. Frank, J.: Learning short-term weights for GSAT. In: Proceedings 15th International Joint Conference on Artificial Intelligence (IJCAI-97). (1997) 384–391
13. Wu, Z., Wah, B.W.: An efficient global-search strategy in discrete Lagrangian methods for solving hard satisfiability problems. In: Proceedings 17th National Conference on Artificial Intelligence (AAAI-2000). (2000) 310–315
14. Levy, A.Y., Fikes, R.E., Sagiv, Y.: Speeding up inferences using relevance reasoning: a formalism and algorithms. Artificial Intelligence 97 (1997) 83–136
15. Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the Association for Computing Machinary 7 (1960) 201–215
16. Selman, B., Kautz, H., McAllester, D.: Ten challenges in propositional reasoning and search. In: Proceedings 15th International Joint Conference on Artificial Intelligence (IJCAI-97). (1997) 50–54
17. Mitchell, D., Levesque, H.: Some pitfalls for experimenters with random SAT. Artificial Intelligence 81 (1996) 111–125
18. Gu, J.: Global optimization for satisfiability problem. IEEE Transactions on Knowledge and Data Engineering 6 (1994) 361–381
19. Nemhauser, G.L., Kan, A.H.G.R., Todd, M.J., eds.: Optimization: Handbooks in Operations Research and Management Science, Volume 1. North-Holland, Amsterdam (1989)
20. Shang, Y., Wah, B.W.: A discrete Lagrangian-based global-search method for solving satisfiability problems. Journal of Global Optimization 12 (1998)
21. Schuurmans, D., Southey, F., Holte, R.C.: The exponentiated subgradient algorithm for heuristic boolean programming. In: Proceedings 17th International Joint Conference on Artificial Intelligence (IJCAI-01). (2001) 334–341
22. Hammer, P., Simeone, B.: Quadratic functions of binary variables. In: Combinatorial Optimization, Lecture Notes in Mathematics. Volume 1403. (1989)
23. Selman, B., Mitchell, D., Levesque, H.: Generating hard satisfiability problems. Artificial Intelligence 81 (1996) 17–29
24. Gomes, C., Selman, B., Crato, N.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning 24 (2000) 67–100
25. Gomes, C.: Structure, duality, and randomization: Common theme inAI and OR. In: Proceedings 17th National Conference on Artificial Intelligence (AAAI-2000). (2000) 1152–1158
26. Hooker, J.N.: Logic, optimization, and constraint programming. (INFORMS journal on Computing) To appear.