Sciweavers

446 search results - page 72 / 90
» Automating Theories in Intuitionistic Logic
Sort
View
SAC
2006
ACM
14 years 1 months ago
Provably faithful evaluation of polynomials
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ...
Sylvie Boldo, César Muñoz
TPHOL
2005
IEEE
14 years 1 months ago
A Design Structure for Higher Order Quotients
The quotient operation is a standard feature of set theory, where a set is partitioned into subsets by an equivalence relation. We reinterpret this idea for higher order logic, whe...
Peter V. Homeier
ILP
2005
Springer
14 years 1 months ago
Strategies to Parallelize ILP Systems
Abstract. It is well known by Inductive Logic Programming (ILP) practioners that ILP systems usually take a long time to find valuable models (theories). The problem is specially ...
Nuno A. Fonseca, Fernando M. A. Silva, Rui Camacho
GLVLSI
2007
IEEE
171views VLSI» more  GLVLSI 2007»
14 years 1 months ago
Combinational equivalence checking for threshold logic circuits
Threshold logic is gaining prominence as an alternative to Boolean logic. The main reason for this trend is the availability of devices that implement these circuits efficiently (...
Tejaswi Gowda, Sarma B. K. Vrudhula, Goran Konjevo...
ECSQARU
2009
Springer
14 years 4 days ago
A Simple Modal Logic for Reasoning about Revealed Beliefs
Abstract. Even though in Artificial Intelligence, a set of classical logical formulae is often called a belief base, reasoning about beliefs requires more than the language of cla...
Mohua Banerjee, Didier Dubois