414 search results - page 71 / 83 » Resolution for Intuitionistic Logic |
DAC
2007
ACM
14 years 9 months ago
2007
ACM
Satisfiability (SAT) solvers often benefit from a preprocessing of the formula to be decided. For formulae in conjunctive normal form (CNF), subsumed clauses may be removed or par...
SARA
2007
Springer
14 years 2 months ago
2007
Springer
Relational databases have had great industrial success in computer science, their power evidenced by theoretical analysis and widespread adoption. Often, automated theorem provers...
WILF
2007
Springer
14 years 2 months ago
2007
Springer
This paper presents a computer implementation that utilizes cross-reference ambiguity in utterances for simple conversational jokes. The approach is based on the SSTH. Using a simp...
WILF
2007
Springer
14 years 2 months ago
2007
Springer
In the resolution of group decision making problems where the consensus process can not be held face to face by the experts it is usually difficult for them to be able to identify ...
GLVLSI
2005
IEEE
14 years 2 months ago
2005
IEEE
As timing requirements in today’s advanced VLSI designs become more aggressive, the need for automated tools to diagnose timing failures increases. This work presents two such a...