Sciweavers

3066 search results - page 388 / 614
» On Facilitating Automated Evaluation
Sort
View
CADE
2009
Springer
14 years 8 months ago
Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
The inverse method is a generic proof search procedure applicable to non-classical logics satisfying cut elimination and the subformula property. In this paper we describe a genera...
Sean McLaughlin, Frank Pfenning
KDD
2002
ACM
173views Data Mining» more  KDD 2002»
14 years 8 months ago
LumberJack: Intelligent Discovery and Analysis of Web User Traffic Composition
Web Usage Mining enables new understanding of user goals on the Web. This understanding has broad applications, and traditional mining techniques such as association rules have bee...
Ed Huai-hsin Chi, Adam Rosien, Jeffrey Heer
VLSID
2002
IEEE
107views VLSI» more  VLSID 2002»
14 years 8 months ago
Automatic Model Refinement for Fast Architecture Exploration
We present a methodology and algorithms for automatic refinement from a given design specification to an architecture model based on decisions in architecture exploration. An arch...
Junyu Peng, Samar Abdi, Daniel Gajski
CADE
2008
Springer
14 years 8 months ago
Proving Bounds on Real-Valued Functions with Computations
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
Guillaume Melquiond
CADE
2007
Springer
14 years 8 months ago
System Description: E-KRHyper
The E-KRHyper system is a model generator and theorem prover for first-order logic with equality. It implements the new E-hyper tableau calculus, which integrates a superposition-b...
Björn Pelzer, Christoph Wernhard