71 search results - page 3 / 15 » On the Modelling of Search in Theorem Proving - Towards a Th... |
TSMC
2010
13 years 14 days ago
2010
In mobile ad hoc networks, nodes have the inherent ability to move. Aside from conducting attacks to maximize their utility and cooperating with regular nodes to deceive them, mali...
CADE
2007
Springer
14 years 6 months ago
2007
Springer
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...
CIIA
2009
13 years 6 months ago
2009
Abstract. Formal verification of digital systems is achieved, today, using one of two main approaches: states exploration (mainly model checking and equivalence checking) or deduct...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Requirements about the quality of clinical guidelines can be represented by schemata borrowed from the theory of abductive diagnosis, using temporal logic to model the time-orient...
ENTCS
2007
13 years 5 months ago
2007
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...