Quantitative Logic Reasoning
From MaRDI portal
Publication:3305344
DOI10.1007/978-3-319-98797-2_12zbMath1439.03059arXiv1905.05665OpenAlexW2897231663MaRDI QIDQ3305344
Publication date: 6 August 2020
Published in: Trends in Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.05665
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- MiniSat
- A linear-time transformation of linear inequalities into conjunctive normal form
- Advanced Łukasiewicz calculus and MV-algebras
- Bookmaking over infinite-valued events
- Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation
- Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
- The coherence of Łukasiewicz assessments is NP-complete
- Probabilistic logic
- Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory. 2nd ed., rev. and enlarged
- Probabilistic satisfiability
- A linear programming approach to reasoning about probabilities
- Cardinality restrictions on concepts
- Probably half true: probabilistic satisfiability over Łukasiewicz infinitely-valued logic
- A logic for reasoning about probabilities
- Algebraic foundations of many-valued reasoning
- Direct algorithms for checking consistency and making inferences from conditional probability assessments
- On logics with two variables
- Towards classifying propositional probabilistic logics
- Easy cases of probabilistic satisfiability
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Complexity of the two-variable fragment with counting quantifiers
- Theory of Probability
- On a generalization of quantifiers
- Column Generation Methods for Probabilistic Logic
- On the Decision Problem for Two-Variable First-Order Logic
- Sul significato soggettivo della probabilità
- Constraint Satisfaction with Counting Quantifiers
- Theory and Applications of Satisfiability Testing
- On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics
- Measures in Boolean Algebras
This page was built for publication: Quantitative Logic Reasoning