Sciweavers

1410 search results - page 91 / 282
» Proving theorems by reuse
Sort
View
CADE
2010
Springer
13 years 11 months ago
Analytic Tableaux for Higher-Order Logic with Choice
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
Julian Backes, Chad E. Brown
GECCO
2008
Springer
127views Optimization» more  GECCO 2008»
13 years 11 months ago
On the possibility to create a compatible--complete unary comparison method for evolutionary multiobjective algorithms
There are several studies on the desirable properties that a performance measure for evolutionary multiobjective algorithms must have. One of these properties is called “compati...
Giovanni Lizárraga Lizárraga, Arturo...
CORR
2008
Springer
151views Education» more  CORR 2008»
13 years 10 months ago
Checking the Quality of Clinical Guidelines using Automated Reasoning Tools
Requirements about the quality of clinical guidelines can be represented by schemata borrowed from the theory of abductive diagnosis, using temporal logic to model the time-orient...
Arjen Hommersom, Peter J. F. Lucas, Patrick van Bo...
EJC
2010
13 years 10 months ago
Partitions versus sets: A case of duality
In a recent paper, Amini et al. introduced a general framework to prove duality theorems between tree decompositions and their dual combinatorial object. They unify all known ad-h...
Laurent Lyaudet, Frédéric Mazoit, St...
JCT
2008
81views more  JCT 2008»
13 years 10 months ago
Algebraic characterization of uniquely vertex colorable graphs
Abstract. The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that k-color...
Christopher J. Hillar, Troels Windfeldt