Sciweavers

1242 search results - page 141 / 249
» The Theory of Grammar Constraints
Sort
View
ICALP
2007
Springer
15 years 4 months ago
Affine Systems of Equations and Counting Infinitary Logic
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
Albert Atserias, Andrei A. Bulatov, Anuj Dawar
96
Voted
CSCLP
2006
Springer
15 years 4 months ago
Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...
Marc Meister, Khalil Djelloul, Thom W. Frühwi...
87
Voted
AIM
2006
15 years 2 months ago
Virtual professional communities and their role for knowledge management
: Virtual professional communities provide an environment for professionals to share their knowledge and develop their skills without geographical constraints. Virtual professional...
Aurelie Dudezert, Harm Heibült, Imed Boughzal...
SNPD
2003
15 years 2 months ago
Estimation of Multiple Motions by Block Matching
This paper deals with the problem of estimating multiple motions at points where these motions are overlaid. We present a new approach that is based on block matching and can deal...
Ingo Stuke, Til Aach, Erhardt Barth, Cicero Mota
155
Voted
PTS
2010
175views Hardware» more  PTS 2010»
14 years 10 months ago
Test Data Generation for Programs with Quantified First-Order Logic Specifications
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
Christoph Gladisch