1650 search results - page 149 / 330 » The HOM problem is decidable |
116
click to vote
ATAL
2006
Springer
15 years 8 months ago
2006
Springer
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
130
click to vote
CADE
2006
Springer
15 years 8 months ago
2006
Springer
We present a tool for checking the sufficient completeness of linear, order-sorted equational specifications modulo associativity, commutativity, and identity. Our tool treats this...
152
click to vote
DAC
1994
ACM
15 years 8 months ago
1994
ACM
-- In previous work, Hu and Dill identified a common cause of BDD-size blowup in high-level design verification and proposed the method of implicitly conjoined invariants to addres...
AAAI
2007
15 years 6 months ago
2007
The reference reconciliation problem consists in deciding whether different identifiers refer to the same data, i.e., correspond to the same world entity. The L2R system exploits...
123
click to vote
ADAEUROPE
2008
Springer
15 years 6 months ago
2008
Springer
Standards for distribution middleware sometimes impose restrictions and often allow the implementations to decide on aspects that are fundamental to the correct and efficient behav...