725 search results - page 108 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
120
click to vote
AAAI
1994
15 years 3 months ago
1994
In this paper we consider updates that are specified as rules and consider simple knowledge bases consisting of ground atoms. We present a translation of the rule based update spe...
122
Voted
ICRA
2010
IEEE
15 years 1 months ago
2010
IEEE
— Classically, the inverse kinematics is performed by computing the singular value decomposition of the matrix to invert. This enables a very simple writing of the algorithm. How...
113
Voted
CADE
2006
Springer
16 years 2 months ago
2006
Springer
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
104
click to vote
ICCSA
2005
Springer
15 years 8 months ago
2005
Springer
Recently, Nenadi´c et al. (2004) proposed the RSA-CEGD protocol for certified delivery of e-goods. This is a relatively complex scheme based on verifiable and recoverable encryp...
133
Voted
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...