Sciweavers

1453 search results - page 109 / 291
» Partial Constraint Satisfaction
Sort
View
COMPASS
1994
15 years 8 months ago
Types, Subtypes, and ASL+
ASL+ is a formalism for speci cation and programming in-the-large, based on an arbitrary institution. It has rules for proving the satisfaction and re nement of speci cations, whic...
David Aspinall
ENTCS
2011
125views more  ENTCS 2011»
14 years 7 months ago
A Hybrid Public Announcement Logic with Distributed Knowledge
In this paper the machinery of Hybrid Logic and the logic of public announcements are merged. In order to bring the two logics together properly the underlying hybrid logic has be...
Jens Ulrik Hansen
ICRA
2005
IEEE
123views Robotics» more  ICRA 2005»
15 years 9 months ago
Stable Pushing of Assemblies
— This paper presents a method to determine whether an assembly of planar parts will stay assembled as it is pushed over a support surface. For a given pushing motion, an assembl...
Jay Bernheisel, Kevin M. Lynch
116
Voted
APPROX
2005
Springer
105views Algorithms» more  APPROX 2005»
15 years 9 months ago
The Complexity of Making Unique Choices: Approximating 1-in- k SAT
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
Venkatesan Guruswami, Luca Trevisan
BIRTHDAY
2005
Springer
15 years 9 months ago
Agents with Exact Foreknowledge
Computational experiments are reported involving the concept of foreknowledge, an agent’s direct, unmediated and accurate, but possibly incomplete, awareness of its future includ...
Jim Doran