5198 search results - page 342 / 1040 » A Logic of Agent Programs |
226
click to vote
MKM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Formal verification of numerical programs is notoriously difficult. On the one hand, there exist automatic tools specialized in floatingpoint arithmetic, such as Gappa...
167
click to vote
AHS
2007
IEEE
16 years 1 months ago
2007
IEEE
Since their invention in the 1980s, the logic density of FPGAs has increased exponentially with time. This increase of logic density first led to the development of synthesisable ...
169
click to vote
IAT
2009
IEEE
16 years 1 months ago
2009
IEEE
—Commitments based on branching time logic are powerful representations for modeling multi-agent interactions. Current approaches into commitments have conceived these representa...
159
click to vote
JELIA
1990
Springer
15 years 10 months ago
1990
Springer
General Epistemic Logics suffer from the problem of logical omniscience, which is that an agent's knowledge and beliefs are closed under implication. There have been many att...
168
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
There is a recent trend of extending epistemic logic (EL) with dynamic operators that allow to express the evolution of knowledge and induced by knowledge-changing actions. The mo...