1032 search results - page 148 / 207 » Extended Computation Tree Logic |
SLP
1994
14 years 11 months ago
1994
We consider a hierarchy of modal event calculi to represent and reason about partially ordered events. These calculi are based on the model of time and change of Kowalski and Sergo...
VSTTE
2012
Springer
13 years 5 months ago
2012
Springer
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...
RTA
2005
Springer
15 years 3 months ago
2005
Springer
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
DLOG
2010
14 years 7 months ago
2010
Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emer...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
Random Forests (RFs) have become commonplace
in many computer vision applications. Their
popularity is mainly driven by their high computational
efficiency during both training ...