1743 search results - page 134 / 349 » Generalized Modal Satisfiability |
100
Voted
DAC
2007
ACM
16 years 4 months ago
2007
ACM
Satisfiability (SAT) solvers often benefit from a preprocessing of the formula to be decided. For formulae in conjunctive normal form (CNF), subsumed clauses may be removed or par...
120
click to vote
WWW
2009
ACM
16 years 4 months ago
2009
ACM
In this paper, we propose a novel approach for composing existing web services to satisfy the correctness constraints to the design, including freeness of deadlock and unspecified...
129
Voted
CADE
2009
Springer
16 years 4 months ago
2009
Springer
The inverse method is a generic proof search procedure applicable to non-classical logics satisfying cut elimination and the subformula property. In this paper we describe a genera...
135
Voted
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
108
Voted
ICRA
2005
IEEE
15 years 9 months ago
2005
IEEE
— In this paper, we discuss the manipulation of an object under hybrid active/passive closure. We show the orthogonality between the directions of active and passive force closur...