Sciweavers

233 search results - page 31 / 47
» Applications of Polytypism in Theorem Proving
Sort
View
ASIAN
2006
Springer
91views Algorithms» more  ASIAN 2006»
15 years 3 months ago
A Type-Theoretic Framework for Formal Reasoning with Different Logical Foundations
Abstract. A type-theoretic framework for formal reasoning with different logical foundations is introduced and studied. With logic-enriched type theories formulated in a logical fr...
Zhaohui Luo
93
Voted
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
15 years 23 days ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
AICOM
2010
92views more  AICOM 2010»
14 years 12 months ago
SOLAR: An automated deduction system for consequence finding
SOLAR (SOL for Advanced Reasoning) is a first-order clausal consequence finding system based on the SOL (Skip Ordered Linear) tableau calculus. The ability to find non-trivial cons...
Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue, O...
ALGORITHMICA
2006
84views more  ALGORITHMICA 2006»
14 years 11 months ago
Large Deviations for the Weighted Height of an Extended Class of Trees
We use large deviations to prove a general theorem on the asymptotic edge-weighted height Hn of a large class of random trees for which Hn c log n for some positive constant c. A...
Nicolas Broutin, Luc Devroye
ENTCS
2008
103views more  ENTCS 2008»
14 years 11 months ago
Systematic Semantic Tableaux for PLTL
The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisf...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...