2291 search results - page 167 / 459 » Representational Reasoning and Verification |
168
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
150
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
179
click to vote
CADE
2003
Springer
16 years 6 months ago
2003
Springer
Ordinals form the basis for termination proofs in ACL2. Currently, ACL2 uses a rather inefficient representation for the ordinals up to 0 and provides limited support for reasoning...
189
click to vote
GPC
2010
Springer
16 years 1 months ago
2010
Springer
Scalability of reasoning systems is one of the main criteria which will determine the success of Semantic Web systems in the future. The focus of recent work is either on (a) expre...
204
click to vote
AIIA
1991
Springer
15 years 10 months ago
1991
Springer
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...