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
Recommendations
Cites work
- scientific article; zbMATH DE number 5838699 (Why is no real title available?)
- scientific article; zbMATH DE number 6003856 (Why is no real title available?)
- scientific article; zbMATH DE number 5139161 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- scientific article; zbMATH DE number 480237 (Why is no real title available?)
- scientific article; zbMATH DE number 6930501 (Why is no real title available?)
- A linear programming approach to reasoning about probabilities
- A linear-time transformation of linear inequalities into conjunctive normal form
- A logic for reasoning about probabilities
- Advanced Łukasiewicz calculus and MV-algebras
- Algebraic foundations of many-valued reasoning
- Bookmaking over infinite-valued events
- Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory. 2nd ed., rev. and enlarged
- Cardinality restrictions on concepts
- Column Generation Methods for Probabilistic Logic
- Complexity of the two-variable fragment with counting quantifiers
- Constraint satisfaction with counting quantifiers
- Direct algorithms for checking consistency and making inferences from conditional probability assessments
- Easy cases of probabilistic satisfiability
- Measures in Boolean Algebras
- Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation
- MiniSat
- On a generalization of quantifiers
- On logics with two variables
- On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics
- On the Decision Problem for Two-Variable First-Order Logic
- Probabilistic logic
- Probabilistic satisfiability
- Probabilistic satisfiability
- Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
- Probably half true: probabilistic satisfiability over Łukasiewicz infinitely-valued logic
- Sul significato soggettivo della probabilità
- The coherence of Łukasiewicz assessments is NP-complete
- Theory and Applications of Satisfiability Testing
- Theory of probability. A critical introductory treatment. Translated from the Italian by Antonio Machí and Adrian Smith. With a new preface by Adrian Smith. In 2 volumes
- Towards classifying propositional probabilistic logics
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
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)