Sciweavers

564 search results - page 67 / 113
» Proof General: A Generic Tool for Proof Development
Sort
View
ICFP
2003
ACM
14 years 7 months ago
Mechanising Hankin and Barendregt using the Gordon-Melham axioms
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
Michael Norrish
GECCO
2007
Springer
163views Optimization» more  GECCO 2007»
14 years 1 months ago
Discovering event evidence amid massive, dynamic datasets
Automated event extraction remains a very difficult challenge requiring information analysts to manually identify key events of interest within massive, dynamic data. Many techniq...
Robert M. Patton, Thomas E. Potok
CP
2006
Springer
13 years 11 months ago
Global Optimization of Probabilistically Constrained Linear Programs
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
Shabbir Ahmed
ACISICIS
2005
IEEE
13 years 9 months ago
Equivalence of Transforming Non-Linear DACG to Linear Concept Tree
This paper introduces a strategy and its theory proof to transform non-linear concept graph: Directed Acyclic Concept Graph (DACG) into a linear concept tree. The transformation i...
Wenyi Bi, Junping Sun
IJCAI
2003
13 years 9 months ago
Weak Conditional Logics of Normality
A default conditional α → β has most often been informally interpreted as a defeasible version of a classical conditional, usually the material conditional. That is, the intui...
James P. Delgrande