Sciweavers

22 search results - page 5 / 5
» Relating Sequent Calculi for Bi-intuitionistic Propositional...
Sort
View
CADE
2007
Springer
14 years 6 months ago
Dependency Pairs for Rewriting with Non-free Constructors
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
Stephan Falke, Deepak Kapur
KR
2000
Springer
13 years 9 months ago
Reduction rules and universal variables for first order tableaux and DPLL
Recent experimental results have shown that the strength of resolution, the propositional DPLL procedure, the KSAT procedure for description logics, or related tableau-like implem...
Fabio Massacci