258 search results - page 1 / 52 » Combining Instance Generation and Resolution |
FROCOS
2009
Springer
13 years 11 months ago
2009
Springer
DAC
2007
ACM
14 years 5 months ago
2007
ACM
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
IJCNLP
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we present a noun phrase coreference resolution system which aims to enhance the identification of the coreference realized by string matching. For this purpose, we ...
CSR
2006
Springer
13 years 8 months ago
2006
Springer
We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applic...
TABLEAUX
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The clause linking technique of Lee and Plaisted proves the unsatisfiability of a set of first-order clauses by generating a sufficiently large set of instances of thes...