Sciweavers

346 search results - page 43 / 70
» Logical omniscience as a computational complexity problem
Sort
View
ICALP
2007
Springer
14 years 1 months ago
Conservative Ambiguity Detection in Context-Free Grammars
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
Sylvain Schmitz
FOSSACS
2000
Springer
13 years 11 months ago
A Program Refinement Framework Supporting Reasoning about Knowledge and Time
Abstract. This paper develops a highly expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of a single agen...
Kai Engelhardt, Ron van der Meyden, Yoram Moses
ERLANG
2003
ACM
14 years 27 days ago
ARMISTICE: an experience developing management software with Erlang
In this paper, some experiences of using the concurrent functional language Erlang to implement a classical vertical application, a risk management information system, are present...
David Cabrero, Carlos Abalde, Carlos Varela, Laura...
ICMCS
2006
IEEE
163views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Methods for None Intrusive Delay Measurment for Audio Communication over Packet Networks
Measurement of the delay is an important and common problem in communication over packet networks. The endto-end and the round trip delay are among the factors directly impacting ...
Mohammad Zad-issa, Norbert Rossello, Laurent Pilat...
ERSHOV
2009
Springer
13 years 11 months ago
Anti-unification Algorithms and Their Applications in Program Analysis
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
Peter E. Bulychev, Egor V. Kostylev, Vladimir A. Z...