Sciweavers

32 search results - page 5 / 7
» Herbrand's theorem and term induction
Sort
View
IEICET
2007
110views more  IEICET 2007»
13 years 7 months ago
A Higher-Order Knuth-Bendix Procedure and Its Applications
The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming lang...
Keiichirou Kusakari, Yuki Chiba
ICAIL
2009
ACM
14 years 2 months ago
Integrating induction and deduction for finding evidence of discrimination
Automatic Decision Support Systems (DSS) are widely adopted for screening purposes in socially sensitive tasks, including access to credit, mortgage, insurance, labor market and o...
Dino Pedreschi, Salvatore Ruggieri, Franco Turini
TACAS
2010
Springer
225views Algorithms» more  TACAS 2010»
14 years 2 months ago
Automated Termination Analysis for Programs with Second-Order Recursion
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
Markus Aderhold
SCP
2011
255views Communications» more  SCP 2011»
13 years 2 months ago
Map fusion for nested datatypes in intensional type theory
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
Ralph Matthes
ILP
2007
Springer
14 years 1 months ago
ILP : - Just Trie It
Abstract. Despite the considerable success of Inductive Logic Programming, deployed ILP systems still have efficiency problems when applied to complex problems. Several techniques ...
Rui Camacho, Nuno A. Fonseca, Ricardo Rocha, V&iac...