455 search results - page 34 / 91 » The Linear Logical Abstract Machine |
BIRTHDAY
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract-- In this paper we present a method for automatically generating optimal robot trajectories satisfying high level mission specifications. The motion of the robot in the en...
KI
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Knowledge compilation is a common technique for propositional logic knowledge bases. The idea is to transform a given knowledge base into a special normal form ([MR03],[D...
64
Voted
SUM
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are intere...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
Abstract. LAPACK90 is a set of LAPACK90 subroutines which interfaces FORTRAN90 with LAPACK. All LAPACK driver subroutines including expert drivers and some LAPACK computationals ha...