Sciweavers

1613 search results - page 68 / 323
» Functional and Constraint Logic Programming
Sort
View
116
Voted
ENTCS
2007
107views more  ENTCS 2007»
15 years 3 months ago
Event Domains, Stable Functions and Proof-Nets
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...
Samson Abramsky
174
Voted
ICFP
2012
ACM
13 years 6 months ago
Functional programming with structured graphs
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...
Bruno C. d. S. Oliveira, William R. Cook
173
Voted
ESANN
1997
15 years 5 months ago
Extraction of crisp logical rules using constrained backpropagation networks
Two recently developed methods for extraction of crisp logical rules from neural networks trained with backpropagation algorithm are compared. Both methods impose constraints on th...
Wlodzislaw Duch, Rafal Adamczak, Krzysztof Grabcze...
130
Voted
LPNMR
2009
Springer
15 years 8 months ago
Belief Logic Programming: Uncertainty Reasoning with Correlation of Evidence
Abstract. Belief Logic Programming (BLP) is a novel form of quantitative logic programming in the presence of uncertain and inconsistent information, which was designed to be able ...
Hui Wan, Michael Kifer
178
Voted
WCFLP
2005
ACM
15 years 9 months ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal