4573 search results - page 638 / 915 » Automated Reasoning |
166
click to vote
ECAI
2000
Springer
15 years 11 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
192
click to vote
AMAI
2000
Springer
15 years 10 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
203
click to vote
FASE
2005
Springer
16 years 5 days ago
2005
Springer
Modeling the dependencies between provided and required services within a software component is necessary for several reasons, such as automated component adaptation and architectu...
160
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
Security protocols are small programs designed to ensure properties such as secrecy of messages or authentication of parties in a hostile environment. In this paper we investigate ...
195
click to vote
CADE
2002
Springer
16 years 7 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...