Sciweavers

1743 search results - page 65 / 349
» Generalized Modal Satisfiability
Sort
View
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 10 months ago
Optimal Path Planning under Temporal Logic Constraints
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...
Stephen L. Smith, Jana Tumova, Calin Belta, Daniel...
ICIP
2007
IEEE
14 years 1 months ago
On Optimal Watermarking Schemes in Uncertain Gaussian Channels
This paper describes the analytical derivation of a new watermarking algorithm satisfying optimality properties when the distortion of the watermarked signal is caused by a Gaussi...
Alvaro A. Cárdenas, George V. Moustakides, ...
AAAI
2000
13 years 11 months ago
On 2-SAT and Renamable Horn
We introduce new linear time algorithms for satisfiability of binary propositional theories (2-SAT), and for recognition and satisfiability of renamable Horn theories. The algorit...
Alvaro del Val
IPL
2000
94views more  IPL 2000»
13 years 9 months ago
On rewrite constraints and context unification
We show that stratified context unification, which is one of the most expressive fragments of context unification known to be decidable, is equivalent to the satisfiability proble...
Joachim Niehren, Sophie Tison, Ralf Treinen
CORR
2010
Springer
102views Education» more  CORR 2010»
13 years 10 months ago
Structure of random r-SAT below the pure literal threshold
It is well known that there is a sharp density threshold for a random r-SAT formula to be satisfiable, and a similar, smaller, threshold for it to be satisfied by the pure literal ...
Alexander D. Scott, Gregory B. Sorkin