Sciweavers

163 search results - page 9 / 33
» Higher-Order Logic and Theorem Proving for Structured Specif...
Sort
View
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
CSL
2007
Springer
14 years 1 months ago
Unbounded Proof-Length Speed-Up in Deduction Modulo
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
Guillaume Burel
TPHOL
1997
IEEE
13 years 11 months ago
An Isabelle-Based Theorem Prover for VDM-SL
This note lists references which address –in some way or another– the problems relating to formal manipulation of logical expressions where terms can fail to denote. Reference...
Sten Agerholm, Jacob Frost
ENTCS
2010
130views more  ENTCS 2010»
13 years 4 months ago
Structural Operational Semantics and Modal Logic, Revisited
A previously introduced combination of the bialgebraic approach to structural operational semantics with aic modal logic is re-examined and improved in some aspects. Firstly, a mo...
Bartek Klin
JLP
2000
140views more  JLP 2000»
13 years 7 months ago
An abductive event calculus planner
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