3131 search results - page 202 / 627 » Generalized connection caching |
127
click to vote
CADE
2007
Springer
16 years 5 months ago
2007
Springer
We present a method for proving rigid first order theorems by encoding them as propositional satisfiability problems. We encode the existence of a first order connection tableau an...
168
Voted
AINA
2009
IEEE
16 years 10 days ago
2009
IEEE
—Opportunistic networks represent one of the most interesting evolution of MANET paradigm. Generally speaking, opportunistic networks enable user communication in environments wh...
147
click to vote
FSTTCS
2009
Springer
16 years 2 days ago
2009
Springer
Linear temporal logic was introduced in order to reason about reactive systems. It is often considered with respect to infinite words, to specify the behaviour of long-running sys...
180
click to vote
LFCS
2009
Springer
16 years 2 days ago
2009
Springer
Canonical propositional Gentzen-type calculi are a natural class of systems which in addition to the standard axioms and structural rules have only logical rules where exactly one ...
134
click to vote
ACSC
2007
IEEE
15 years 12 months ago
2007
IEEE
In this paper we propose an algorithm for automatic transformation of a graph into a 3D Virtual World and its Euclidean map, using the rectangular dualization technique. The nodes...