585 search results - page 47 / 117 » Strategy Logic |
132
click to vote
FPGA
2004
ACM
15 years 7 months ago
2004
ACM
The cost functions used to evaluate logic synthesis transformations for FPGAs are far removed from the final speed and routability determined after placement, routing and timing a...
132
click to vote
IJCAI
2003
15 years 3 months ago
2003
Query answering over commonsense knowledge bases typically employs a first-order logic theorem prover. While first-order inference is intractable in general, provers can often b...
110
click to vote
ENTCS
2007
15 years 1 months ago
2007
The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an i...
86
Voted
ILP
2004
Springer
15 years 7 months ago
2004
Springer
This paper focuses on inductive learning of recursive logical theories from a set of examples. This is a complex task where the learning of one predicate definition should be inter...
107
Voted
APAL
2008
15 years 2 months ago
2008
Most type systems are agnostic regarding the evaluation strategy for the underlying languages, with the value restriction for ML which is absent in Haskell as a notable exception....