10568 search results - page 560 / 2114 » Computer Intelligence and Formalization |
143
click to vote
RECOMB
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. There have been many widely used genome rearrangement models, such as reversals, HannenhalliPevzner, and double-cut and join. Though each one can be precisely defined, t...
143
click to vote
IEEEPACT
2007
IEEE
16 years 23 days ago
2007
IEEE
The process of verifying a new microprocessor is a major problem for the computer industry. Currently, architects design processors to be fast, power-efficient, and reliable. Howe...
192
click to vote
TLCA
2007
Springer
16 years 17 days ago
2007
Springer
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
193
Voted
ACL2
2006
ACM
16 years 13 days ago
2006
ACM
We describe an embedding of the ACL2 logic into higherorder logic. An implementation of this embedding allows ACL2 to be used as an oracle for higher-order logic provers. Categori...
165
click to vote
SIGCSE
2006
ACM
16 years 12 days ago
2006
ACM
We present a hands-on approach to problem solving in the formal languages and automata theory course. Using the tool JFLAP, students can solve a wide range of problems that are te...