3738 search results - page 468 / 748 » Parametrized Logic Programming |
84
Voted
ECCC
2007
15 years 23 days ago
2007
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
151
click to vote
CSL
2007
Springer
15 years 7 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
69
Voted
ATAL
2005
Springer
15 years 6 months ago
2005
Springer
There are many situations where an agent can perform one of several sets of actions in responses to changes in its environment, and the agent chooses to perform the set of actions...
141
click to vote
FDL
2004
IEEE
15 years 4 months ago
2004
IEEE
System-on-Chip (SOC) and other complex distributed hardware/software systems contain heterogeneous components such as DSPs, micro-controllers, application specific logic etc., whi...
99
Voted
DEBS
2008
ACM
15 years 2 months ago
2008
ACM
We propose a sensornet programming model based on declarative spatio-temporal constraints on events only, not sensors. Where previous approaches conflate events and sensors becaus...