Sciweavers

1960 search results - page 5 / 392
» The Logic of Large Enough
Sort
View
CADE
2005
Springer
14 years 8 months ago
Reflecting Proofs in First-Order Logic with Equality
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
Evelyne Contejean, Pierre Corbineau
AIML
2008
13 years 9 months ago
An interval logic for natural language semantics
Most temporal logics, particularly interval temporal logics, are not expressive enough to capture meanings of natural language constructions, and they are not convenient to represe...
Savas Konur
ICALP
2004
Springer
14 years 1 months ago
Easily Refutable Subformulas of Large Random 3CNF Formulas
Abstract. A simple nonconstructive argument shows that most 3CNF formulas with cn clauses (where c is a large enough constant) are not satisfiable. It is an open question whether ...
Uriel Feige, Eran Ofek
ITC
1999
IEEE
118views Hardware» more  ITC 1999»
13 years 12 months ago
Logic BIST for large industrial designs: real issues and case studies
This paper discusses practical issues involved in applying logic built-in self-test (BIST) to four large industrial designs. These multi-clock designs, ranging in size from 200K t...
Graham Hetherington, Tony Fryars, Nagesh Tamarapal...
DLOG
2004
13 years 9 months ago
The Instance Store: DL Reasoning with Large Numbers of Individuals
We present an application
Ian Horrocks, Lei Li, Daniele Turi, Sean Bechhofer