Sciweavers

367 search results - page 31 / 74
» Adapting functional programs to higher order logic
Sort
View
84
Voted
TBILLC
2005
Springer
15 years 6 months ago
Natural Logic for Natural Language
We implement the extension of the logical consequence relation to a partial order ≤ on arbitary types built from e (entities) and t (Booleans) that was given in [1], and the de...
Jan van Eijck
113
Voted
JFP
2000
163views more  JFP 2000»
15 years 9 days ago
Automatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
Ferruccio Damiani, Paola Giannini
86
Voted
ADAEUROPE
2004
Springer
15 years 6 months ago
High-Integrity Interfacing to Programmable Logic with Ada
Abstract. Programmable logic devices (PLDs) are now common components of safety-critical systems, and are increasingly used for safetyrelated or safety-critical functionality. Rece...
Adrian J. Hilton, Jon G. Hall
125
Voted
ICASSP
2011
IEEE
14 years 4 months ago
Global convergence of independent component analysis based on semidefinite programming relaxation
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
Shotaro Akaho, Jun Fujiki
ICLP
2010
Springer
15 years 4 months ago
Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions
Probabilistic Logic Programming is an active field of research, with many proposals for languages, semantics and reasoning algorithms. One such proposal, Logic Programming with A...
Fabrizio Riguzzi, Terrance Swift