764 search results - page 114 / 153 » On the Expressibility of Stable Logic Programming |
117
click to vote
CLOUD
2010
ACM
15 years 4 months ago
2010
ACM
Over the last 10–15 years, our industry has developed and deployed many large-scale Internet services, from e-commerce to social networking sites, all facing common challenges i...
SIGSOFT
2007
ACM
16 years 16 days ago
2007
ACM
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
WSC
2000
15 years 1 months ago
2000
Analytical models for the dynamics of some discrete event systems are introduced where the system trajectories are solutions to linear and mixed-integer programs. 1 BACKGROUND The...
DEBS
2008
ACM
15 years 1 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...
111
click to vote
ATAL
2010
Springer
15 years 50 min ago
2010
Springer
One of the most challenging aspects of reasoning, planning, and acting in a multi-agent domain is reasoning about what the agents know about the knowledge of their fellows, and to...