136 search results - page 5 / 28 » The Satisfiability Problem for Probabilistic Ordered Branchi... |
LOGCOM
2011
12 years 10 months ago
2011
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optim...
ICCSA
2004
Springer
14 years 1 months ago
2004
Springer
The algorithmic techniques which allow high efficiency in the precise calculation of the reliability of an undirected graph with absolutely reliable nodes and unreliable edges are ...
ENTCS
2010
13 years 5 months ago
2010
We present MLSolver, a tool for solving the satisfiability and validity problems for modal fixpoint logics. The underlying technique is based on characterisations of satisfiabilit...
IPCO
2010
13 years 9 months ago
2010
We introduce the framework of polyhedral branching systems that can be used in order to construct extended formulations for polyhedra by combining extended formulations for other p...
AAAI
2006
13 years 9 months ago
2006
One of the main topics of research in genomics is determining the relevance of mutations, described in haplotype data, as causes of some genetic diseases. However, due to technolo...