Sciweavers

118 search results - page 10 / 24
» Focused Inductive Theorem Proving
Sort
View
ICFCA
2007
Springer
13 years 11 months ago
On Multi-adjoint Concept Lattices: Definition and Representation Theorem
Several fuzzifications of formal concept analysis have been proposed to deal with uncertainty or incomplete information. In this paper, we focus on the new paradigm of multi-adjoin...
Jesús Medina, Manuel Ojeda-Aciego, Jorge Ru...
SYNTHESE
2008
88views more  SYNTHESE 2008»
13 years 7 months ago
Interpolation in computing science: the semantics of modularization
The Interpolation Theorem, first formulated and proved by W. Craig fifty years ago for predicate logic, has been extended to many other logical frameworks and is being applied in s...
Gerard R. Renardel de Lavalette
TPHOL
2005
IEEE
14 years 1 months ago
Alpha-Structural Recursion and Induction
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
Andrew M. Pitts
JLP
2007
114views more  JLP 2007»
13 years 7 months ago
Deaccumulation techniques for improving provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
TACAS
2009
Springer
128views Algorithms» more  TACAS 2009»
14 years 2 months ago
All-Termination(T)
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
Panagiotis Manolios, Aaron Turon