Sciweavers

1960 search results - page 250 / 392
» The Logic of Large Enough
Sort
View
85
Voted
EACL
2009
ACL Anthology
16 years 1 months ago
Evaluating the Inferential Utility of Lexical-Semantic Resources
Lexical-semantic resources are used extensively for applied semantic inference, yet a clear quantitative picture of their current utility and limitations is largely missing. We pr...
Shachar Mirkin, Ido Dagan, Eyal Shnarch
CADE
2008
Springer
16 years 1 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
77
Voted
CADE
2008
Springer
16 years 1 months ago
The Annual SUMO Reasoning Prizes at CASC
Previous CASC competitions have focused on proving difficult problems on small numbers of axioms. However, typical reasoning applications for expert systems rely on knowledge base...
Adam Pease, Geoff Sutcliffe, Nick Siegel, Steven T...
97
Voted
CADE
2008
Springer
16 years 1 months ago
A Small Framework for Proof Checking
We describe a framework with which first order theorem provers can be used for checking formal proofs. The main aim of the framework is to take as much advantage as possible from t...
Hans de Nivelle, Piotr Witkowski
99
Voted
CADE
2007
Springer
16 years 1 months ago
T-Decision by Decomposition
Much research concerning Satisfiability Modulo Theories is devoted to the design of efficient SMT-solvers that integrate a SATsolver with T -satisfiability procedures. The rewrite-...
Maria Paola Bonacina, Mnacho Echenim