3970 search results - page 552 / 794 » A Logic For Causal Reasoning |
166
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The paper presents a simple and concise proof of correctness of the magic transformation. We believe it may provide a useful example of formal reasoning about logic programs. The ...
216
click to vote
LICS
2012
IEEE
13 years 9 months ago
2012
IEEE
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
191
click to vote
JELIA
2010
Springer
15 years 5 months ago
2010
Springer
Stable belief sets were introduced by R. Stalnaker in the early ’80s, as a formal representation of the epistemic state for an ideal introspective agent. This notion motivated M...
237
click to vote
ILP
2007
Springer
16 years 23 days ago
2007
Springer
A recurrent question in the design of intelligent agents is how to assign degrees of beliefs, or subjective probabilities, to various events in a relational environment. In the sta...
159
click to vote
PPOPP
2006
ACM
16 years 18 days ago
2006
ACM
We study a family of implementations for linked lists using finegrain synchronisation. This approach enables greater concurrency, but correctness is a greater challenge than for ...