322 search results - page 43 / 65 » Combinations of Abstract Domains for Logic Programming |
127
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
118
Voted
CP
2007
Springer
15 years 10 months ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
154
Voted
COMSWARE
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— Wireless sensor networks consist of small, inexpensive devices which interact with the environment, communicate with each other, and perform distributed computations in...
136
Voted
PLDI
2005
ACM
15 years 9 months ago
2005
ACM
Concepts are an essential language feature for generic programming in the large. Concepts allow for succinct expression of constraints on type parameters of generic algorithms, en...
151
Voted
FOIS
2006
15 years 5 months ago
2006
Abstract. Across a wide range of domains, there is an urgent need for a wellfounded approach to incorporating uncertain and incomplete knowledge into formal domain ontologies. Alth...