Sciweavers

1094 search results - page 148 / 219
» On Computing Explanations in Argumentation
Sort
View
LPNMR
2009
Springer
14 years 5 months ago
Simple Random Logic Programs
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” pr...
Gayathri Namasivayam, Miroslaw Truszczynski
LICS
2008
IEEE
14 years 5 months ago
Hiding Local State in Direct Style: A Higher-Order Anti-Frame Rule
Separation logic involves two dual forms of modularity: local reasoning makes part of the store invisible within a static scope, whereas hiding local state makes part of the store...
François Pottier
LICS
2008
IEEE
14 years 5 months ago
Typed Normal Form Bisimulation for Parametric Polymorphism
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
Søren B. Lassen, Paul Blain Levy
IJCNN
2006
IEEE
14 years 5 months ago
On derivation of stagewise second-order backpropagation by invariant imbedding for multi-stage neural-network learning
— We present a simple, intuitive argument based on “invariant imbedding” in the spirit of dynamic programming to derive a stagewise second-order backpropagation (BP) algorith...
Eiji Mizutani, Stuart Dreyfus
TRIDENTCOM
2005
IEEE
14 years 4 months ago
Wireless Nomadic Transfer over Mobile Ad hoc Networks
Mobile ad hoc networking allows the development of several infrastructure free applications. One of the arguments we focused on is the possibility of deploying a set of services i...
Stefano Annese, Andrea Ghittino