Quantitative Logic Reasoning

DOI10.1007/978-3-319-98797-2_12zbMATH Open1439.03059arXiv1905.05665OpenAlexW2897231663MaRDI QIDQ3305344

Marcelo Finger

Publication date: 6 August 2020

Published in: Trends in Logic (Search for Journal in Brave)

Abstract: In this paper we show several similarities among logic systems that deal simultaneously with deductive and quantitative inference. We claim it is appropriate to call the tasks those systems perform as Quantitative Logic Reasoning. Analogous properties hold throughout that class, for whose members there exists a set of linear algebraic techniques applicable in the study of satisfiability decision problems. In this presentation, we consider as Quantitative Logic Reasoning the tasks performed by propositional Probabilistic Logic; first-order logic with counting quantifiers over a fragment containing unary and limited binary predicates; and propositional Lukasiewicz Infinitely-valued Probabilistic Logic

Full work available at URL: https://arxiv.org/abs/1905.05665

Mathematics Subject Classification ID

Probability and inductive logic (03B48) Many-valued logic (03B50)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• MiniSat
• Theory and Applications of Satisfiability Testing
• Probably half true: probabilistic satisfiability over Łukasiewicz infinitely-valued logic
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Probabilistic logic
• A linear programming approach to reasoning about probabilities
• Algebraic foundations of many-valued reasoning
• Column Generation Methods for Probabilistic Logic
• Advanced Łukasiewicz calculus and MV-algebras
• A logic for reasoning about probabilities
• On a generalization of quantifiers
• On the Decision Problem for Two-Variable First-Order Logic
• On logics with two variables
• A linear-time transformation of linear inequalities into conjunctive normal form
• Sul significato soggettivo della probabilità
• Bookmaking over infinite-valued events
• The coherence of Łukasiewicz assessments is NP-complete
• Complexity of the two-variable fragment with counting quantifiers
• Direct algorithms for checking consistency and making inferences from conditional probability assessments
• Cardinality restrictions on concepts
• Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory. 2nd ed., rev. and enlarged
• Theory of Probability
• Towards classifying propositional probabilistic logics
• Constraint Satisfaction with Counting Quantifiers
• Measures in Boolean Algebras
• Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation
• Probabilistic satisfiability
• Easy cases of probabilistic satisfiability
• Probabilistic satisfiability
• Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
• On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics

Cited In (1)

• Quantitative logic

Uses Software

• MiniSat
• Lingeling
• LIPSAT

This page was built for publication: Quantitative Logic Reasoning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3305344)