634 search results - page 43 / 127 » Completion Procedures as Semidecision Procedures |
CADE
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. This paper presents a technique for automated theorem proving with free variable tableaux that does not require backtracking. Most existing automated proof procedures usi...
CSL
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. It has been proved by Niwi´nski and Walukiewicz that a deterministic tree language is either Π1 1 -complete or it is on the level Π0 3 of the Borel hierarchy, and that...
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
In this work we evaluate a Particle Swarm Optimizer hybridized with Differential Evolution and apply it to the BlackBox Optimization Benchmarking for noisy functions (BBOB 2009)....
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
In this work we evaluate a Particle Swarm Optimizer hybridized with Differential Evolution and apply it to the BlackBox Optimization Benchmarking for noiseless functions (BBOB 20...
WFLP
2009
Springer
15 years 2 months ago
2009
Springer
Numerous computational and deductive frameworks use the notion of strategy to guide reduction and search space exploration, making the macro scale control of micro operations an ex...