Sciweavers

438 search results - page 11 / 88
» On theorem proving in annotated logics
Sort
View
JSYML
2010
103views more  JSYML 2010»
13 years 2 months ago
A note on Hjorth's oscillation theorem
We reformulate, in the context of continuous logic, an oscillation theorem proved by G. Hjorth and give a proof of the theorem in that setting which is similar to, but simpler than...
Julien Melleray
ECP
1997
Springer
102views Robotics» more  ECP 1997»
13 years 11 months ago
Event Calculus Planning Revisited
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...
Murray Shanahan
BIRTHDAY
2006
Springer
13 years 11 months ago
Proving Behavioral Refinements of COL-specifications
The COL institution (constructor-based observational logic) has been introduced as a formal framework to specify both generationand observation-oriented properties of software syst...
Michel Bidoit, Rolf Hennicker
PPCP
1993
13 years 11 months ago
Higher-Order Logic Programming as Constraint Logic Programming
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
Spiro Michaylov, Frank Pfenning
ISOLA
2007
Springer
14 years 1 months ago
Proved Development of the Real-Time Properties of the IEEE 1394 Root Contention Protocol with the Event B Method
We present a model of the IEEE 1394 Root Contention Protocol with a proof of Safety. This model has real-time properties which are expressed in the language of the event B method: ...
Joris Rehm, Dominique Cansell