Sciweavers

689 search results - page 57 / 138
» The multithreaded version of FORM
Sort
View
CSL
2001
Springer
14 years 10 days ago
Constrained Hyper Tableaux
Hyper tableau reasoning is a version of clausal form tableau reasoning where all negative literals in a clause are resolved away in a single inference step. Constrained hyper table...
Jan van Eijck
ECAI
2000
Springer
14 years 5 days ago
Incremental Forward Checking for the Disjunctive Temporal Problem
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...
Angelo Oddi, Amedeo Cesta
SIGCSE
1999
ACM
145views Education» more  SIGCSE 1999»
14 years 4 days ago
Using JFLAP to interact with theorems in automata theory
An automata theory course can be taught in an interactive, hands-on manner using a computer. At Duke we have been using the software tool JFLAP to provide interaction and feedback...
Eric Gramond, Susan H. Rodger
FSE
1999
Springer
101views Cryptology» more  FSE 1999»
14 years 3 days ago
Mod n Cryptanalysis, with Applications Against RC5P and M6
We introduce “mod n cryptanalysis,” a form of partitioning attack that is effective against ciphers which rely on modular addition and bit rotations for their security. We dem...
John Kelsey, Bruce Schneier, David Wagner
COMPGEOM
1990
ACM
13 years 12 months ago
Minimum-Link Paths Among Obstacles in the Plane
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
Joseph S. B. Mitchell, Günter Rote, Gerhard J...