Sciweavers

1960 search results - page 120 / 392
» The Logic of Large Enough
Sort
View
AND
2010
13 years 7 months ago
Document: a useful level for facing noisy data
In this paper we will present a set of experiments using large digitalized collections of books to show that logical structures can be extracted with good quality when working at ...
Hervé Déjean, Jean-Luc Meunier
KI
2009
Springer
14 years 3 months ago
External Sources of Axioms in Automated Theorem Proving
Abstract. In recent years there has been a growing demand for Automated Theorem Proving (ATP) in large theories, which often have more axioms than can be handled effectively as no...
Martin Suda, Geoff Sutcliffe, Patrick Wischnewski,...
SAT
2004
Springer
106views Hardware» more  SAT 2004»
14 years 2 months ago
The Optimality of a Fast CNF Conversion and its Use with SAT
Despite the widespread use and study of Boolean satisfiability for a diverse range of problem domains, encoding of problems is usually given to general propositional logic with li...
Daniel Sheridan
ICIW
2007
IEEE
14 years 1 months ago
Type-Based Static and Dynamic Website Verification
Abstract-- Maintaining large websites and verifying their semantic content is a difficult task. In this paper we propose a framework for syntactic validation, semantic verification...
Jorge Coelho, Mário Florido
CADE
1998
Springer
14 years 23 days ago
Rank/Activity: A Canonical Form for Binary Resolution
Abstract. The rank/activity restriction on binary resolution is introduced. It accepts only a single derivation tree from a large equivalence class of such trees. The equivalence c...
Joseph Douglas Horton, Bruce Spencer