285 search results - page 1 / 57 » On Continuous Models of Computation: Towards Computing the D... |
IWFM
2003
13 years 6 months ago
2003
We present a report on work in progress on certain aspects of a programme of research concerned with building formal, mathematical models both for aspects of the computational pro...
SCP
1998
13 years 4 months ago
1998
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
BIRTHDAY
2010
Springer
13 years 9 months ago
2010
Springer
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...
MEMOCODE
2003
IEEE
13 years 10 months ago
2003
IEEE
An executable computational logic can provide the desired bridge between formal system properties and formal methods to verify them on the one hand, and executable models of syste...
AAAI
1990
13 years 5 months ago
1990
An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stabl...