344 search results - page 4 / 69 » The Santa Claus problem |
24
Voted
IJCAI
1989
13 years 9 months ago
1989
This paper addresses two problems concerning the issue of redundant information in resolution based reasoning systems. The first one deals with the question, how the derivation of...
BIRTHDAY
2006
Springer
14 years 9 days ago
2006
Springer
We consider secrecy problems for cryptographic protocols modeled using Horn clauses and present general classes of Horn clauses which can be efficiently decided. Besides simplifyin...
AUSAI
2003
Springer
14 years 1 months ago
2003
Springer
SAT
2004
Springer
14 years 1 months ago
2004
Springer
Despite the widespread use and study of Boolean satisfiability for a diverse range of problem domains, encoding of problems is usually given to general propositional logic with li...
CONSTRAINTS
2010
13 years 6 months ago
2010
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...