742 search results - page 43 / 149 » Considerations in Automated Marking |
TPHOL
2002
IEEE
14 years 18 days ago
2002
IEEE
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
TPHOL
1999
IEEE
13 years 12 months ago
1999
IEEE
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We have constructed a syst...
CCL
1994
Springer
13 years 11 months ago
1994
Springer
Abstract. We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicat...
KR
1989
Springer
13 years 11 months ago
1989
Springer
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
EWCBR
2000
Springer
13 years 11 months ago
2000
Springer
Collaborative filtering systems make recommendations based on the accumulation of ratings by many users. The process has a case-based reasoning flavor: recommendations are generate...