Sciweavers

290 search results - page 53 / 58
» Logical Properties of Name Restriction
Sort
View
LPAR
2012
Springer
12 years 3 months ago
E-Matching with Free Variables
E-matching is the most commonly used technique to handle quantifiers in SMT solvers. It works by identifying characteristic subexpressions of quantified formulae, named triggers,...
Philipp Rümmer
CE
2008
122views more  CE 2008»
13 years 7 months ago
Ubiquitous learning website: Scaffold learners by mobile devices with information-aware techniques
The portability and immediate communication properties of mobile devices influence the learning processes in interacting with peers, accessing resources and transferring data. For...
G. D. Chen, C. K. Chang, C. Y. Wang
CORR
2006
Springer
120views Education» more  CORR 2006»
13 years 7 months ago
Termination orders for 3-dimensional rewriting
Abstract: This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource ma...
Yves Guiraud
CIE
2007
Springer
14 years 1 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
CHARME
2005
Springer
122views Hardware» more  CHARME 2005»
14 years 1 months ago
Regular Vacuity
The application of model-checking tools to complex systems involves a nontrivial step of modelling the system by a finite-state model and a translation of the desired properties i...
Doron Bustan, Alon Flaisher, Orna Grumberg, Orna K...