4617 search results - page 647 / 924 » Automation of Diagrammatic Reasoning |
191
click to vote
LPAR
2005
Springer
16 years 27 days ago
2005
Springer
We investigate some syntactic properties of Wadler’s dual calculus, a term calculus which corresponds to classical sequent logic in the same way that Parigot’s λµ calculus co...
201
click to vote
LPAR
2005
Springer
16 years 27 days ago
2005
Springer
In this paper the Recursive Path Ordering is adapted for proving termination of rewriting incrementally. The new ordering, called Recursive Path Ordering with Modules, has as ingre...
168
click to vote
LPAR
2005
Springer
16 years 27 days ago
2005
Springer
We describe a sound, terminating, and complete matching algorithm for terms built over flexible arity function symbols and context, function, sequence, and individual variables. C...
175
click to vote
LPAR
2005
Springer
16 years 27 days ago
2005
Springer
An overview is given of a number of recent developments in SAT and SAT Modulo Theories (SMT). In particular, based on our k of Abstract DPLL and Abstract DPLL modulo Theories, we e...
190
click to vote
LPAR
2005
Springer
16 years 27 days ago
2005
Springer
Abstract. The paper describes the formalization and implementation of an efficient constraint programming framework operating on 3D crystal lattices. The framework is motivated an...