Sciweavers

1650 search results - page 244 / 330
» The HOM problem is decidable
Sort
View
CLEF
2007
Springer
16 years 15 days ago
Overview of the Answer Validation Exercise 2007
The Answer Validation Exercise at the Cross Language Evaluation Forum is aimed at developing systems able to decide whether the answer of a Question Answering system is correct or...
Anselmo Peñas, Álvaro Rodrigo, Felis...
FORMATS
2007
Springer
16 years 14 days ago
Undecidability of Universality for Timed Automata with Minimal Resources
Timed automata were introduced by Alur and Dill in the early 1990s and have since become the most prominent modelling formalism for real-time systems. A fundamental limit to the al...
Sara Adams, Joël Ouaknine, James Worrell
LPNMR
2007
Springer
16 years 13 days ago
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
Michael Fink, Reinhard Pichler, Hans Tompits, Stef...
MIDDLEWARE
2007
Springer
16 years 13 days ago
Correlation-Based Content Adaptation for Mobile Web Browsing
The resource impoverished environment on mobile devices results in a poor experience for users browsing the World Wide Web. Proxy-based middleware that transform content on the fl...
Iqbal Mohomed, Adin Scannell, Nilton Bila, Jin Zha...
TACAS
2007
Springer
116views Algorithms» more  TACAS 2007»
16 years 13 days ago
Model Checking on Trees with Path Equivalences
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
Rajeev Alur, Pavol Cerný, Swarat Chaudhuri