6167 search results - page 79 / 1234 » Can Refinement be Automated |
KR
2004
Springer
14 years 4 months ago
2004
Springer
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...
LICS
1994
IEEE
14 years 3 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
FORTE
2001
14 years 16 days ago
2001
Use cases are useful in various stages of the software process. They are very often described using text that has to be interpreted by system designers. This could lead to implemen...
FDL
2005
IEEE
14 years 4 months ago
2005
IEEE
Heterogeneous system specifications implicitly assume parallel execution of their components that rely on supporting platform architectures and operating systems. Unfortunately, c...
DAGM
2006
Springer
14 years 2 months ago
2006
Springer
Dense depth maps can be estimated in a Bayesian sense from multiple calibrated still images of a rigid scene relative to a reference view [1]. This well-established probabilistic f...