7892 search results - page 86 / 1579 » Programming with Models |
122
click to vote
FUIN
2000
15 years 1 months ago
2000
We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L...
107
click to vote
TPHOL
2003
IEEE
15 years 6 months ago
2003
IEEE
Abstract. Model checking and theorem proving are two complementary approaches to formal verification. In this paper we show how binary decision diagram (BDD) based symbolic model ...
122
click to vote
CAV
2010
Springer
2010
Springer
Universal Causality Graphs: A Precise Happens-Before Model for Detecting Bugs in Concurrent Programs
15 years 3 months ago
Triggering errors in concurrent programs is a notoriously difficult task. A key reason for this is the behavioral complexity resulting from the large number of interleavings of op...
126
click to vote
ATAL
2010
Springer
15 years 1 months 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...
113
click to vote
BMEI
2008
IEEE
15 years 7 months ago
2008
IEEE
Standard Gene Expression Programming(GEP) works with fixed rate of mutation and crossover, ignoring the variation of the individual fitness, hence it works in the local optimum st...