2540 search results - page 35 / 508 » Abstract Logics as Dialgebras |
145
click to vote
CADE
2001
Springer
16 years 6 months ago
2001
Springer
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...
185
click to vote
TPHOL
2000
IEEE
15 years 10 months ago
2000
IEEE
Abstract. This paper presents proof terms for simply typed, intuitionistic higher order logic, a popular logical framework. Unification-based algorithms for the compression and re...
168
click to vote
AGI
2011
14 years 9 months ago
2011
Abstract. Non-Axiomatic Logic (NAL) is designed for intelligent reasoning, and can be used in a system that has insufficient knowledge and resources with respect to the problems to...
165
click to vote
LOPSTR
2004
Springer
15 years 11 months ago
2004
Springer
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
168
click to vote
CADE
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. This article describes the first public version of the satisfiability modulo theory (SMT) solver veriT. It is open-source, proof-producing, and complete for quantifier-fr...