58 search results - page 4 / 12 » Resolution Proof Systems with Weak Transformation Rules |
AAAI
2010
13 years 8 months ago
2010
Modern complete SAT solvers almost uniformly implement variations of the clause learning framework introduced by Grasp and Chaff. The success of these solvers has been theoretical...
ATAL
2000
Springer
13 years 11 months ago
2000
Springer
In this paper we propose a methodology to help analyse tendencies in MAS to complement those of simple inspection, Monte Carlo and syntactic proof. We suggest an architecture that ...
IACR
2011
12 years 7 months ago
2011
We present a generic transformation that allows us to use a large class of pairing-based signatures to construct schemes for signing group elements in a structure preserving way. A...
FROCOS
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. Isabelle/HOL is a popular interactive theorem prover based on higherorder logic. It owes its success to its ease of use and powerful automation. Much of the automation is...
BIRTHDAY
2008
Springer
13 years 9 months ago
2008
Springer
Reconfigurable place/transition systems are Petri nets with initial markings and a set of rules which allow the modification of the net during runtime in order to adapt the net to ...