58 search results - page 8 / 12 » csl 2007 |
163
click to vote
CSL
2007
Springer
15 years 12 months ago
2007
Springer
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
151
click to vote
CSL
2007
Springer
15 years 12 months ago
2007
Springer
Abstract. Establishing local consistency is one of the main algorithmic techniques in temporal and spatial reasoning. In this area, one of the central questions for the various pro...
143
click to vote
CSL
2007
Springer
15 years 12 months ago
2007
Springer
We study the complexity of satisfiability for DLP+ dyn , an expressive logic introduced by Demri that allows to reason about dynamic policies. DLP+ dyn extends the logic DLPdyn of...
134
click to vote
CSL
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. A longstanding open problem is whether there exists a nonsyntactical model of the untyped -calculus whose theory is exactly the least -theory . In this paper we investiga...
194
click to vote
CSL
2007
Springer
15 years 5 months ago
2007
Springer
In a spoken dialog system, determining which action a machine should take in a given situation is a difficult problem because automatic speech recognition is unreliable and hence ...