4617 search results - page 414 / 924 » Automation of Diagrammatic Reasoning |
161
click to vote
LPNMR
2005
Springer
16 years 8 days ago
2005
Springer
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
176
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...
164
click to vote
CADE
2005
Springer
16 years 7 months ago
2005
Springer
We present the theory and implementation of a theorem prover for first-order intuitionistic linear logic based on the inverse method. The central proof-theoretic insights underlyin...
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...
208
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...