4513 search results - page 502 / 903 » Logic programming with satisfiability |
215
click to vote
POPL
2001
ACM
16 years 5 months ago
2001
ACM
We present a variant of Proof-Carrying Code (PCC) in which the trusted inference rules are represented as a higher-order logic program, the proof checker is replaced by a nondeter...
131
click to vote
ICFP
2002
ACM
16 years 4 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
178
click to vote
ARGMAS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. One of the most difficult problems in multiagent systems involves representing knowledge and beliefs of agents in dynamic environments. New perceptions modify an agent’...
145
click to vote
CIDR
2011
14 years 8 months ago
2011
Distributed programming has become a topic of widespread interest, and many programmers now wrestle with tradeoffs between data consistency, availability and latency. Distributed...
134
click to vote
RTSS
1999
IEEE
15 years 9 months ago
1999
IEEE
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...