851 search results - page 26 / 171 » Inaccessibility in Decision Procedures |
129
Voted
LPAR
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We describe a novel decision procedure for Quantified Boolean Formulas (QBFs) which aims to unleash the hidden potential of quantified reasoning in applications. The Sk...
132
Voted
EMO
2009
Springer
15 years 10 months ago
2009
Springer
A nadir point is constructed by the worst objective values of the solutions of the entire Pareto-optimal set. Along with the ideal point, the nadir point provides the range of obje...
142
Voted
ACL2
2006
ACM
15 years 10 months ago
2006
ACM
We describe a new procedure for verifying ACL2 properties about finite state machines (FSMs) using satisfiability (SAT) solving. We present an algorithm for converting ACL2 conj...
139
Voted
SOFSEM
2009
Springer
16 years 25 days ago
2009
Springer
Abstract. Computational mechanism design (CMD) seeks to understand how to design game forms that induce desirable outcomes in multiagent systems despite private information, self-i...
151
Voted
CSFW
2012
IEEE
13 years 6 months ago
2012
IEEE
—We show that Kripke semantics of modal logic, manifest in the syntactic proof formalism of labeled sequent calculi, can be used to solve three central problems in access control...