Sciweavers

3729 search results - page 376 / 746
» On Formal Modeling of Agent Computations
Sort
View
AAAI
1992
15 years 8 months ago
Automated Model Selection Using Context-Dependent Behaviors
Effective problem-solving about complex engineered devices requires device models that are both adequate for the problem and computationally efficient . Producing such models requ...
P. Pandurang Nayak, Leo Joskowicz, Sanjaya Addanki
ICFEM
2000
Springer
15 years 10 months ago
Using Use Cases in Executable Z
Use Cases are a wide-spread informal method for specifying the requirements of a technical system in the early development phase. Z is a formal notation which aims to support, bes...
Wolfgang Grieskamp, Markus Lepper
IWFM
2003
123views Formal Methods» more  IWFM 2003»
15 years 8 months ago
Derivation of Distributed Programs in the Theory of Owicki and Gries: An Example
This paper describes the derivation of a program for the propagation of information over a network, with acknowledgement (feedback) when the computation is complete. The derivatio...
Doug Goldson
JAIR
2006
102views more  JAIR 2006»
15 years 6 months ago
Properties and Applications of Programs with Monotone and Convex Constraints
We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of...
Lengning Liu, Miroslaw Truszczynski
IJCNN
2008
IEEE
16 years 1 months ago
Dynamic logic of phenomena and cognition
—Modeling of complex phenomena such as the mind presents tremendous computational complexity challenges. The neural modeling fields theory (NMF) addresses these challenges in a n...
Boris Kovalerchuk, Leonid I. Perlovsky