453 search results - page 65 / 91 » FLUX: A Logic Programming Method for Reasoning Agents |
218
click to vote
POPL
2011
ACM
14 years 8 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
284
click to vote
ICFP
2009
ACM
16 years 6 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
162
Voted
EMSOFT
2008
Springer
15 years 7 months ago
2008
Springer
We focus on decomposition of hard-masking real-time faulttolerant programs (where safety, timing constraints, and liveness are preserved in the presence of faults) that are design...
186
click to vote
KR
2004
Springer
15 years 11 months ago
2004
Springer
Negotiation plays a key role as a means for sharing information and resources with the aim of looking for a common agreement. This paper proposes a new approach based on possibili...
170
Voted
PPDP
2007
Springer
16 years 3 days ago
2007
Springer
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...