Toward formalizing usefulness in propositional language

Authors:
Yi Zhou;Xiaoping Chen
Affiliations:
Multi-agent System Lab, Computer Science Department, University of Science and Technology of China (USTC), HeFei, AnHui, China;Multi-agent System Lab, Computer Science Department, University of Science and Technology of China (USTC), HeFei, AnHui, China
Venue:
KSEM'06 Proceedings of the First international conference on Knowledge Science, Engineering and Management
Year:
2006

Citing 6
Cited 2

Relevance from an epistemic perspective

Artificial Intelligence - Special issue on relevance
Conditional independence in propositional logic

Artificial Intelligence
Novelty Revisited

ISMIS '91 Proceedings of the 6th International Symposium on Methodologies for Intelligent Systems
Propositional independence: formula-variable independence and forgetting

Journal of Artificial Intelligence Research
A logical account of relevance

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Hidden uncertainty in the logical representation of desires

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence

Partial goal satisfaction and goal change: weak and strong partial implication, logical properties, complexity

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
A logical study of partial entailment

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we attempt to capture the notion of usefulness in propositional language. We believe that classical implication captures a certain kind of usefulness, and name it strict usefulness. We say that a formula P is strictly useful to a formula Q under a formula set Γif and only if P implies Q under Γ in classical propositional logic. We also believe that classical implication is too strict to capture the whole notion of usefulness. Therefore, we extend it in two ways. The first one is partial usefulness, which means that if P is true, then Q will be partially true under the background of Γ. The second one is probabilistic usefulness, which means that the probability of Q is true will increase by given P is true under Γ. This paper provides semantic definitions of them respectively in propositional language, and discusses the fundamental properties of them.