Theory and Applications of Satisfiability Testing
7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers
Article
Development of languages for specifying or modelling problems is an important direction in constraint modelling. To provide greater abstraction and modelling convenience, these languages are becoming more synt...
Chapter and Conference Paper
We apply the logic-based declarative programming approach of Model Expansion (MX) to a phylogenetic inference task. We axiomatize the task in multi-sorted first-order logic with cardinality constraints. Using ...
Book and Conference Proceedings
7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers
Chapter and Conference Paper
Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, for domain size d. The schemes are not equivalent...
Chapter and Conference Paper
We study two resolution-like refutation systems for finite-domain constraint satisfaction problems, and the efficiency of these and of common CSP algorithms. By comparing the relative strength of these systems...
Chapter and Conference Paper
Random instances are widely used as benchmarks in evaluating algorithms for finite-domain constraint satisfaction problems (CSPs). We present an analysis that shows why deciding satisfiability of instances fro...
Article
Article
Article
96-h LC50's were determined for Nais communis Piguet and Ilyodrilus frantzi Brinkhurst in relation to selected pollutants (Hg, NaPCP) and environmental factors (pH, temperature, salinity). The naidid N. communis ...