A survey of average time analyses of satisfiability algorithms
Journal of Information Processing
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Relations and graphs: discrete mathematics for computer scientists
Relations and graphs: discrete mathematics for computer scientists
Experimental results on the crossover point in random 3-SAT
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics
Multi-objective problems in terms of relational algebra
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Solving algorithmic problems on orders and lattices by relation algebra and RELVIEW
CASC'06 Proceedings of the 9th international conference on Computer Algebra in Scientific Computing
Semigroupoid interfaces for relation-algebraic programming in haskell
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Evaluating sets of search points using relational algebra
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
| Hi-index | 0.00 |
We present a method for specifying and implementing algorithms for Boolean logic problems. It is formally grounded in relational algebra. Specifications are written in first-order set theory and then transformed systematically into relation-algebraic forms which can be executed directly in RelView, a computer system for the manipulation of relations and relational programming. Our method yields programs that are correct by construction. It is illustrated by some examples.