Abstract. In this paper, we propose an adaptive algorithm for merging n (n2) prioritized knowledge bases which takes into account the degrees of conflict and agreement among these ...
Abstract. Bedau et al.'s statistical classification system for long-term evolutionary dynamics provides a test for open-ended evolution. Making this test more rigorous, and pa...
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
The outcome of verifying software is often a `counterexample', i.e., a listing of the actions and states of a behavior not satisfying the specification. In order to understan...
Abstract. Local similarity computation between two sequences permits detecting all the relevant alignments present between subsequences thereof. A well-known dynamic programming al...