634 search results - page 74 / 127 » Completion Procedures as Semidecision Procedures |
WSC
2001
14 years 11 months ago
2001
The system presented bridges the gap between three different research areas: discrete event simulation, heuristic optimization methods and distributed systems technology. Its goal...
AAAI
1998
14 years 11 months ago
1998
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...
AAAI
1997
14 years 11 months ago
1997
In this paper, we present a novel first order theorem proving strategy - ordered semantic hyper linking. Ordered semantic hyper linking (OSHL) is an instance-based refutational th...
IJCAI
1997
14 years 11 months ago
1997
Evaluation of incomplete algorithms that solve SAT requires to generate hard satisfiable instances. For that purpose, the kSAT uniform random generation is not usable. The other g...
AAAI
1990
14 years 11 months ago
1990
A formal equivalence between propositional expert systems and decision tables is proved, and a practicable procedure given to perform the transformation between propositional expe...