11436 search results - page 586 / 2288 » Modeling Real Reasoning |
207
click to vote
CCS
1999
ACM
15 years 11 months ago
1999
ACM
We describe and analyze a new digital signature scheme. The new scheme is quite efficient, does not require the the signer to maintain any state, and can be proven secure against ...
171
click to vote
TPHOL
1999
IEEE
15 years 11 months ago
1999
IEEE
Gandalf is a first-order resolution theorem-prover, optimized for speed and specializing in manipulations of large clauses. In this paper I describe GANDALF TAC, a HOL tactic that ...
185
click to vote
LPNMR
1997
Springer
15 years 11 months ago
1997
Springer
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...
217
click to vote
ICLP
1992
Springer
15 years 11 months ago
1992
Springer
We discuss a declarative characterization of inheritance in logic programming. Our approach is inspired both by existing literature on denotational models for inheritance and by e...
193
click to vote
ICLP
2010
Springer
15 years 11 months ago
2010
Springer
Interactive Scores is a formalism for the design and performance of interactive scenarios that provides temporal relations (TRs) among the objects of the scenario. We can model TRs...