4573 search results - page 398 / 915 » Automated Reasoning |
188
click to vote
CADE
2003
Springer
16 years 7 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...
177
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
Satisfiability Modulo Theories (SMT) solvers have proven highly scalable, efficient and suitable for integrated theory reasoning. The most efficient SMT solvers rely on refutationa...
210
click to vote
FLOPS
2010
Springer
16 years 1 months ago
2010
Springer
The logical framework LF provides an elegant foundation for specifying formal systems and proofs and it is used successfully in a wide range of applications such as certifying code...
159
click to vote
ECSQARU
2007
Springer
16 years 1 months ago
2007
Springer
Traditional Dempster Shafer belief theory does not provide a simple method for judging the effect of statistical and probabilistic data on belief functions and vice versa. This put...
201
click to vote
ICLP
2007
Springer
16 years 1 months ago
2007
Springer
The paper presents a prototype system HD-Rules (Hybrid integration of Description Logic and Rules) that integrates normal clauses under the wellfounded semantics with ontologies sp...