Sciweavers

681 search results - page 85 / 137
» Combining Theorem Proving with Natural Language Processing
Sort
View
ICALP
1998
Springer
15 years 1 months ago
A Hierarchy of Equivalences for Asynchronous Calculi
We generate a natural hierarchy of equivalences for asynchronous name-passing process calculi from simple variations on Milner and Sangiorgi's definition of weak barbed bisim...
Cédric Fournet, Georges Gonthier
179
Voted
SIGMOD
2007
ACM
225views Database» more  SIGMOD 2007»
15 years 10 months ago
From complete to incomplete information and back
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
Lyublena Antova, Christoph Koch, Dan Olteanu
ESOP
2010
Springer
15 years 7 months ago
Parameterized Memory Models and Concurrent Separation Logic
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
Rodrigo Ferreira, Xinyu Feng and Zhong Shao
ICFP
1999
ACM
15 years 2 months ago
Specialization of Inductively Sequential Functional Logic Programs
Functional logic languages combine the operational principles of the most important declarative programming paradigms, namely functional and logic programming. Inductively sequent...
María Alpuente, Michael Hanus, Salvador Luc...
ASSETS
2007
ACM
15 years 1 months ago
Corpus studies in word prediction
Word prediction can be used to enhance the communication rate of people with disabilities who use Augmentative and Alternative Communication (AAC) devices. We use statistical meth...
Keith Trnka, Kathleen F. McCoy