1943 search results - page 163 / 389 » Ordering Default Theories |
157
click to vote
SBIA
1998
Springer
15 years 11 months ago
1998
Springer
This paper presents Darwinci, a system that generates new ideas, using a multi-domain knowledge base composed by musical and drawing structures. Its theoretical background comes fr...
218
click to vote
ACSD
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper we present two algorithms that effectively synthesize a finite place/transition Petri net (p/t-net) from a finite set of labeled partial orders (a finite partial lang...
162
click to vote
ITP
2010
15 years 11 months ago
2010
Abstract. The Satisfiability Modulo Theories (SMT) solver Z3 can generate proofs of unsatisfiability. We present independent reconstruction of these proofs in the theorem provers...
176
click to vote
ITP
2010
15 years 11 months ago
2010
Abstract. We present a new scheme to translate mathematical developments from HOL Light to Coq, where they can be re-used and rechecked. By relying on a carefully chosen embedding ...
175
click to vote
FCT
2007
Springer
15 years 11 months ago
2007
Springer
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, a...