146 search results - page 6 / 30 » Modelling and solving temporal reasoning as propositional sa... |
120
Voted
ATAL
2010
Springer
15 years 2 months ago
2010
Springer
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...
114
Voted
LPAR
2010
Springer
14 years 11 months ago
2010
Springer
In this paper we introduce an extension of propositional logic that allows clauses to be weighted with values from a generic semiring. The main interest of this extension is that ...
113
click to vote
AUSAI
2007
Springer
15 years 5 months ago
2007
Springer
In this paper we describe a stochastic local search (SLS) procedure for finding satisfying models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on th...
130
click to vote
JSAT
2008
15 years 1 months ago
2008
In this paper we describe a stochastic local search (SLS) procedure for finding models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on the features...
115
Voted
CL
2000
Springer
15 years 5 months ago
2000
Springer
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiabilit...