Sciweavers

1144 search results - page 90 / 229
» Logic programming for combinatorial problems
Sort
View
219
Voted
PODS
2009
ACM
130views Database» more  PODS 2009»
16 years 3 months ago
The finite model theory toolbox of a database theoretician
For many years, finite model theory was viewed as the backbone of database theory, and database theory in turn supplied finite model theory with key motivations and problems. By n...
Leonid Libkin
ICALP
2007
Springer
15 years 8 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
ICALP
2005
Springer
15 years 8 months ago
On the Wake-Up Problem in Radio Networks
Abstract. Radio networks model wireless communication when processing units communicate using one wave frequency. This is captured by the property that multiple messages arriving s...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...
IGPL
2006
130views more  IGPL 2006»
15 years 2 months ago
Verifying Temporal Heap Properties Specified via Evolution Logic
Abstract. This paper addresses the problem of establishing temporal properties of programs written in languages, such as Java, that make extensive use of the heap to allocate-and d...
Eran Yahav, Thomas W. Reps, Shmuel Sagiv, Reinhard...
IFIP
2009
Springer
15 years 9 months ago
Static Detection of Logic Flaws in Service-Oriented Applications
Application or business logic, used in the development of services, has to do with the operations that define the application functionalities and not with the platform ones. Often...
Chiara Bodei, Linda Brodo, Roberto Bruni