Sciweavers

1960 search results - page 163 / 392
» The Logic of Large Enough
Sort
View
CADE
1998
Springer
14 years 1 months ago
Strict Basic Superposition
It is a well-known fact that some form of factoring is necessary for completeness of paramodulation-based calculi of general first-order clauses. In this paper we give an overview...
Leo Bachmair, Harald Ganzinger
WLP
1997
Springer
14 years 1 months ago
Constrained Partial Deduction
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
Michael Leuschel, Danny De Schreye
FPGA
2006
ACM
90views FPGA» more  FPGA 2006»
14 years 28 days ago
Improving performance and robustness of domain-specific CPLDs
Many System-on-a-Chip devices would benefit from the inclusion of reprogrammable logic on the silicon die, as it can add general computing ability, provide run-time reconfigurabil...
Mark Holland, Scott Hauck
RSCTC
2000
Springer
185views Fuzzy Logic» more  RSCTC 2000»
14 years 25 days ago
A Comparison of Several Approaches to Missing Attribute Values in Data Mining
: In the paper nine different approaches to missing attribute values are presented and compared. Ten input data files were used to investigate the performance of the nine methods t...
Jerzy W. Grzymala-Busse, Ming Hu
IJCAI
1989
13 years 10 months ago
On the Declarative Semantics of Inheritance Networks
Usually, semantics of inheritance networks is specified indirectly through a translation into one of the standard logical formalisms. Since such translation involves an algorithmi...
Krishnaprasad Thirunarayan, Michael Kifer, David S...