Sciweavers

236 search results - page 39 / 48
» Unifying Logical and Probabilistic Reasoning
Sort
View
PLILP
1992
Springer
15 years 1 months ago
Unfold/fold Transformations Preserving Termination Properties
The unfold/fold framework constitutes the spine of many program transformation strategies. However, by unrestricted use of folding the target program may terminate less often than...
Torben Amtoft
ICFP
2009
ACM
15 years 10 months ago
Purely functional lazy non-deterministic programming
Functional logic programming and probabilistic programming have demonstrated the broad benefits of combining laziness (non-strict evaluation with sharing of the results) with non-...
Sebastian Fischer, Oleg Kiselyov, Chung-chieh Shan
IJCAI
2007
14 years 11 months ago
Argumentation Based Contract Monitoring in Uncertain Domains
Few existing argumentation frameworks are designed to deal with probabilistic knowledge, and none are designed to represent possibilistic knowledge, making them unsuitable for man...
Nir Oren, Timothy J. Norman, Alun D. Preece
105
Voted
ILP
2007
Springer
15 years 3 months ago
Learning to Assign Degrees of Belief in Relational Domains
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...
Frédéric Koriche
CSFW
2003
IEEE
15 years 2 months ago
Anonymity and Information Hiding in Multiagent Systems
We provide a framework for reasoning about information-hiding requirements in multiagent systems and for reasoning about anonymity in particular. Our framework employs the modal l...
Joseph Y. Halpern, Kevin R. O'Neill