Computing all optimal solutions in satisfiability problems with preferences

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

Volumn 5202 LNCS, Issue , 2008, Pages 603-607

  Di Rosa, Emanuele ^a   Giunchiglia, Enrico ^a   Maratea, Marco ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; AUTOMATA THEORY; COMPUTER PROGRAMMING; CONSTRAINT THEORY; OPTIMAL SYSTEMS; SOLUTIONS;

CONSTRAINT PROGRAMMING COMMUNITIES; CONSTRAINT SATISFACTION PROBLEMS; OPTIMAL SOLUTIONS; SATISFIABILITY PROBLEMS; VIABLE SOLUTIONS;

PROBLEM SOLVING;

EID: 56449088895     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85958-1_50     Document Type: Conference Paper

References (9)

1. Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. J. Artif Intell. Res (JAIR)21, 135-191 (2004)
2. Giunchiglia, E., Maratea, M.: Solving optimization problems with DLL. In: Proc. of 17th European Conference on Artificial Intelligence (ECAI), pp. 377-381 (2006)
3. Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: Preference-based constrained optimization with CP-nets. Computational Intelligence 20(2), 137-157 (2004)
4. Järvisalo, M., Junttila, T., Niemelä, I.: Unrestricted vs restricted cut in a tableau method for Boolean circuits. Annals of Mathematics and Artificial Intelligence 44(4), 373-399 (2005)
5. Giunchiglia, E., Maratea, M.: Planning as satisfiability with preferences. In: Proc. of 22nd AAAI Conference on Artificial Intelligence, pp. 987-992. AAAI Press, Menlo Park (2007)
6. Davis, M., Logemann, G., Loveland, D.W.: A machine program for theorem proving. Communication of ACM 5(7), 394-397 (1962)
7. Tseitin, G.: On the complexity of proofs in propositional logics. Seminars in Mathematics 8 (1970); Reprinted in [9]
8. Plaisted, D.A., Greenbaum, S.: A Structure-preserving Clause Form Translation. Journal of Symbolic Computation 2, 293-304 (1986)
9. Siekmann, J., Wrightson, G. (eds.): Automation of Reasoning: Classical Papers in Computational Logic 1967-1970, vol. 1-2. Springer, Heidelberg (1983)