Sciweavers

1022 search results - page 41 / 205
» Stable models and circumscription
Sort
View
CORR
2006
Springer
121views Education» more  CORR 2006»
13 years 7 months ago
On Using Matching Theory to Understand P2P Network Design
This paper aims to provide insight into stability of collaboration choices in P2P networks. We study networks where exchanges between nodes are driven by the desire to receive the...
Dmitry Lebedev, Fabien Mathieu, Laurent Viennot, A...
NN
2007
Springer
13 years 7 months ago
Chaotic pattern transitions in pulse neural networks
In models of associative memory composed of pulse neurons, chaotic pattern transitions where the pattern retrieved by the network changes chaotically were found. The network is co...
Takashi Kanamaru
IBERAMIA
2004
Springer
14 years 1 months ago
Well Founded Semantics for Logic Program Updates
Over the last years various semantics have been proposed for dealing with updates of logic programs by (other) logic programs. Most of these semantics extend the stable models sema...
Federico Banti, José Júlio Alferes, ...
AMAI
2006
Springer
13 years 7 months ago
A generalization of the Lin-Zhao theorem
The theorem on loop formulas due to Fangzhen Lin and Yuting Zhao shows how to turn a logic program into a propositional formula that describes the program's stable models. In...
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz
CDC
2009
IEEE
115views Control Systems» more  CDC 2009»
14 years 13 days ago
An error bound for model reduction of Lur'e-type systems
— In general, existing model reduction techniques for stable nonlinear systems lack a guarantee on stability of the reduced-order model, as well as an error bound. In this paper,...
Bart Besselink, Nathan van de Wouw, Henk Nijmeijer