756 search results - page 100 / 152 » Using Logic Programs to Reason about Infinite Sets |
ENTCS
2006
14 years 9 months ago
2006
Temporal logics are well suited for the specification and verification of systems of communicating agents. In this paper we adopt a social approach to agent communication, where c...
DLOG
2008
15 years 2 days ago
2008
We present a novel Fuzzy Description Logic (DL) based approach to automate matchmaking in e-marketplaces. We model traders' preferences with the aid of Fuzzy DLs and, given a ...
159
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
118
click to vote
HASKELL
2009
ACM
15 years 4 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
113
click to vote
POPL
2011
ACM
14 years 17 days 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...