Results 1 - 10
of
18,353
A Unifying Semantics for Belief Change
"... Abstract. Many belief change formalisms employ plausibility orderings over the set of possible worlds to determine how the beliefs of an agent ought to be modified after the receipt of a new epistemic input. While most such possible world semantics rely on a single ordering, we look at using an extr ..."
Abstract
- Add to MetaCart
an extra ordering to aid in guiding the process of belief change. We show that this provides a unifying semantics for a wide variety of belief change operators. By varying the conditions placed on the second ordering, different families of known belief change operators can be captured, including AGM belief
A.: A unifying semantics for belief change
- In: Proceedings of ECAI 2004
, 2004
"... Abstract. Many belief change formalisms employ plausibility orderings over the set of possible worlds to determine how the beliefs of an agent ought to be modified after the receipt of a new epistemic input. While most such possible world semantics rely on a single ordering, we look at using an extr ..."
Abstract
-
Cited by 4 (4 self)
- Add to MetaCart
an extra ordering to aid in guiding the process of belief change. We show that this provides a unifying semantics for a wide variety of belief change operators. By varying the conditions placed on the second ordering, different families of known belief change operators can be captured, including AGM belief
A Unifying Semantics for Belief Change Abstract
"... Many belief change formalisms employ plausibility orderings over the set of possible worlds to determine how the beliefs of an agent ought to be modified after the receipt of a new epistemic input. While most such possible world semantics rely on a single ordering, we look at using an extra ordering ..."
Abstract
- Add to MetaCart
ordering to aid in guiding the process of belief change. We show that this provides a unifying semantics for a wide variety of belief change operators. By varying the conditions placed on the second ordering, different families of known belief change operators can be captured, including AGM belief
Efficient belief propagation for early vision
- In CVPR
, 2004
"... Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph cuts and belief propagation yield accurate results, but despite recent advances are often still too slow for practical u ..."
Abstract
-
Cited by 515 (8 self)
- Add to MetaCart
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph cuts and belief propagation yield accurate results, but despite recent advances are often still too slow for practical
Self-efficacy: Toward a unifying theory of behavioral change
- Psychological Review
, 1977
"... The present article presents an integrative theoretical framework to explain and to predict psychological changes achieved by different modes of treatment. This theory states that psychological procedures, whatever their form, alter the level and strength of self-efficacy. It is hypothesized that ex ..."
Abstract
-
Cited by 3697 (4 self)
- Add to MetaCart
, and physiological states. The more dependable the experiential sources, the greater are the changes in perceived selfefficacy. A number of factors are identified as influencing the cognitive processing of efficacy information arising from enactive, vicarious, exhortative, and emotive
The Entity-Relationship Model: Toward a Unified View of Data
- ACM Transactions on Database Systems
, 1976
"... A data model, called the entity-relationship model, is proposed. This model incorporates some of the important semantic information about the real world. A special diagrammatic technique is introduced as a tool for database design. An example of database design and description using the model and th ..."
Abstract
-
Cited by 1829 (6 self)
- Add to MetaCart
A data model, called the entity-relationship model, is proposed. This model incorporates some of the important semantic information about the real world. A special diagrammatic technique is introduced as a tool for database design. An example of database design and description using the model
Ontologies are us: A unified model of social networks and semantics
- In International Semantic Web Conference
, 2005
"... Abstract. On the Semantic Web ontologies are most commonly treated as artifacts created by knowledge engineers for a particular community. The task of the engineers is to forge a common understanding within the community and to formalize the agreements, prerequisites of reusing domain knowledge in i ..."
Abstract
-
Cited by 466 (3 self)
- Add to MetaCart
Abstract. On the Semantic Web ontologies are most commonly treated as artifacts created by knowledge engineers for a particular community. The task of the engineers is to forge a common understanding within the community and to formalize the agreements, prerequisites of reusing domain knowledge
Semantic matching of web services capabilities
, 2002
"... Abstract. The Web is moving from being a collection of pages toward a collection of services that interoperate through the Internet. The first step toward this interoperation is the location of other services that can help toward the solution of a problem. In this paper we claim that location of web ..."
Abstract
-
Cited by 581 (24 self)
- Add to MetaCart
of web services should be based on the semantic match between a declarative description of the service being sought, and a description of the service being offered. Furthermore, we claim that this match is outside the representation capabilities of registries such as UDDI and languages such as WSDL. We
Loopy belief propagation for approximate inference: An empirical study. In:
- Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" -the use of Pearl's polytree algorithm in a Bayesian network with loops -can perform well in the context of error-correcting codes. The most dramatic instance of this is the near Shannon-limit performanc ..."
Abstract
-
Cited by 676 (15 self)
- Add to MetaCart
to converge if none of the beliefs in successive iterations changed by more than a small threshold (10-4). All messages were initialized to a vector of ones; random initializa tion yielded similar results, since the initial conditions rapidly get "washed out" . For comparison, we also implemented
A logic of authentication
- ACM TRANSACTIONS ON COMPUTER SYSTEMS
, 1990
"... Questions of belief are essential in analyzing protocols for the authentication of principals in distributed computing systems. In this paper we motivate, set out, and exemplify a logic specifically designed for this analysis; we show how various protocols differ subtly with respect to the required ..."
Abstract
-
Cited by 1332 (22 self)
- Add to MetaCart
Questions of belief are essential in analyzing protocols for the authentication of principals in distributed computing systems. In this paper we motivate, set out, and exemplify a logic specifically designed for this analysis; we show how various protocols differ subtly with respect to the required
Results 1 - 10
of
18,353