2905 search results - page 77 / 581 » Formal Memetic Algorithms |
165
click to vote
TLCA
1993
Springer
15 years 10 months ago
1993
Springer
This paper describes formalizations of Tait’s normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs p...
162
Voted
CAV
1994
Springer
15 years 10 months ago
1994
Springer
This paper presents a new formalism and a new algorithm for verifying timed circuits. The formalism, called orbital nets, allows hierarchical verification based on abehavioralseman...
145
click to vote
ICFCA
2009
Springer
16 years 1 months ago
2009
Springer
This paper revisits the lattice-based thesaurus models which Margaret Masterman used for machine translation in the 1950’s and 60’s. Masterman’s notions are mapped onto moder...
142
click to vote
AAAI
1994
15 years 7 months ago
1994
This paper conjectures a computational account of how children might learn the meanings of words in their native language. First, a simplified version of the lexical acquisition t...
152
click to vote
ICFCA
2007
Springer
16 years 15 days ago
2007
Springer
Pseudo-intents (also called pseudo-closed sets) of formal contexts have gained interest in recent years, since this notion is helpful for finding minimal representations of impli...