On real-valued evaluation of propositional formulas

Authors:
Aleksandar Perović;Dragan Doder;Zoran Ognjanović
Affiliations:
Faculty of Transportation and Traffic Engineering, University of Belgrade, Serbia;Faculty of Mechanical Engineering, University of Belgrade, Serbia;Mathematical Institute of Serbian Academy of Sciences and Arts, Serbia
Venue:
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Year:
2012

Citing 32
Cited 0

Probabilistic logic

Artificial Intelligence
Belief structures, possibility theory and decomposable confidence measures on finite sets

Computers and Artificial Intelligence
Some algebraic and geometric computations in PSPACE

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A logic for reasoning about probabilities

Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Nonmonotonic reasoning, preferential models and cumulative logics

Artificial Intelligence
Theoretical foundations for non-monotonic reasoning in expert systems

Logics and models of concurrent systems
What does a conditional knowledge base entail?

Artificial Intelligence
Reasoning about knowledge and probability

Journal of the ACM (JACM)
General patterns in nonmonotonic reasoning

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Conditional objects, possibility theory and default rules

Conditionals
Some first-order probability logics

Theoretical Computer Science
Some contributions to nonmonotonic consequence

Journal of Computer Science and Technology
Probabilistic Default Reasoning with Conditional Constraints

Annals of Mathematics and Artificial Intelligence
A modal analysis of possibility theory

FAIR '91 Proceedings of the International Workshop on Fundamentals of Artificial Intelligence Research
Some Varieties of Qualitative Probability

IPMU'94 Selected papers from the 5th International Conference on Processing and Management of Uncertainty in Knowledge-Based Systems, Advances in Intelligent Computing
Reasoning about Uncertainty

Reasoning about Uncertainty
Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity

Journal of Logic and Computation
Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: Complexity, algorithms, and implementation

International Journal of Approximate Reasoning
Strong non-standard completeness for fuzzy logics

Soft Computing - A Fusion of Foundations, Methodologies and Applications - Special issue (pp 315-357) "Ordered structures in many-valued logic"
On triangular norms and uninorms definable in Ł Π12

International Journal of Approximate Reasoning
Two Representation Theorems for Non-monotonic Inference Relations*

Journal of Logic and Computation
Qualitative Possibilities and Necessities

ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
A logic for reasoning about evidence

Journal of Artificial Intelligence Research
Weak nonmonotonic probabilistic logics

Artificial Intelligence
A probabilistic logic with polynomial weight formulas

FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Measures of inconsistency and defaults

International Journal of Approximate Reasoning
Finitely additive probability measures on classical propositional formulas definable by Gödel's t-norm and product t-norm

Fuzzy Sets and Systems
Probabilistic approach to nonmonotonic consequence relations

ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
A branching time logic with two types of probability operators

SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Fuzzy logic and probability

UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Generalized qualitative probability: savage revisited

UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
A probabilistic temporal logic that can model reasoning about evidence

FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Arguably, [0,1]-valued evaluation of formulas is dominant form of representation of uncertainty, believes, preferences and so on despite some theoretical issues - most notable one is incompleteness of any unrestricted finitary formalization. We offer an infinitary propositional logic (formulas remain finite strings of symbols, but we use infinitary inference rules with countably many premises, primarily in order to address the incompleteness issue) which is expressible enough to capture finitely additive probabilistic evaluations, some special cases of truth functionality (evaluations in Lukasiewicz, product, Gödel and ŁΠ1/2 logics) and the usual comparison of such evaluations. The main technical result is the proof of completeness theorem (every consistent set of formulas is satisfiable).