Sciweavers

71 search results - page 2 / 15
» On the Modelling of Search in Theorem Proving - Towards a Th...
Sort
View
AAAI
1997
13 years 6 months ago
Ordered Semantic Hyper Linking
In this paper, we present a novel first order theorem proving strategy - ordered semantic hyper linking. Ordered semantic hyper linking (OSHL) is an instance-based refutational th...
David A. Plaisted, Yunshan Zhu
CADE
2002
Springer
14 years 5 months ago
Reasoning by Symmetry and Function Ordering in Finite Model Generation
Abstract. Finite model search for first-order logic theories is complementary to theorem proving. Systems like Falcon, SEM and FMSET use the known LNH (Least Number Heuristic) heur...
Gilles Audemard, Belaid Benhamou
QEST
2007
IEEE
13 years 11 months ago
Probabilistic Model Checking Modulo Theories
— Probabilistic models are widely used to analyze embedded, networked, and more recently biological systems. Existing numerical analysis techniques are limited to finitestate mo...
Björn Wachter, Lijun Zhang, Holger Hermanns
ATAL
2006
Springer
13 years 9 months ago
Integrating parallel interactions into cooperative search
In this paper we incorporate autonomous agents' capability to perform parallel interactions into the cooperative search model, resulting in a new method which outperforms the...
Efrat Manisterski, David Sarne, Sarit Kraus
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
13 years 6 months 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