Sciweavers

382 search results - page 44 / 77
» Complexity and Expressive Power of Logic Programming
Sort
View
PLDI
2009
ACM
14 years 2 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
ICFP
2005
ACM
14 years 7 months ago
PolyAML: a polymorphic aspect-oriented functional programming language
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
Daniel S. Dantas, David Walker, Geoffrey Washburn,...
KR
2010
Springer
14 years 15 days ago
Probabilistic Description Logics for Subjective Uncertainty
We propose a new family of probabilistic description logics (DLs) that, in contrast to most existing approaches, are derived in a principled way from Halpern’s probabilistic fi...
Carsten Lutz, Lutz Schröder
CN
2007
168views more  CN 2007»
13 years 7 months ago
A MAC layer power management scheme for efficient energy delay tradeoff in a WLAN
— Energy efficient operation is of paramount importance for battery-powered wireless nodes. In an effort to conserve energy, standard protocols for WLANs have the provision for w...
Mahasweta Sarkar, Rene L. Cruz
OTM
2007
Springer
14 years 1 months ago
Multi-stage Aspect-Oriented Composition of Component-Based Applications
Abstract. The creation of distributed applications requires sophisticated compositions, as various components — supporting application logic or non-functional requirements — mu...
Bert Lagaisse, Eddy Truyen, Wouter Joosen