On Counting Propositional Logic

03/23/2021
by   Melissa Antonelli, et al.
0

We study counting propositional logic as an extension of propositional logic with counting quantifiers. We prove that the complexity of the underlying decision problem perfectly matches the appropriate level of Wagner's counting hierarchy, but also that the resulting logic admits a satisfactory proof-theoretical treatment. From the latter, a type system for a probabilistic lambda-calculus is derived in the spirit of the Curry-Howard correspondence, showing the potential of counting propositional logic as a useful tool in several fields of theoretical computer science.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/28/2022

Some Remarks on Counting Propositional Logic

Counting propositional logic was recently introduced in relation to rand...
research
05/14/2019

Quantitative Logic Reasoning

In this paper we show several similarities among logic systems that deal...
research
06/01/2011

Reasoning about Minimal Belief and Negation as Failure

We investigate the problem of reasoning in the propositional fragment of...
research
03/21/2022

Curry and Howard Meet Borel

We show that an intuitionistic version of counting propositional logic c...
research
10/19/2021

Pre and Post Counting for Scalable Statistical-Relational Model Discovery

Statistical-Relational Model Discovery aims to find statistically releva...
research
05/16/2022

Efficient Knowledge Compilation Beyond Weighted Model Counting

Quantitative extensions of logic programming often require the solution ...
research
08/13/2021

Natural Deduction Calculus for First-Order Logic

The purpose of this paper is to give an easy to understand with step-by-...

Please sign up or login with your details

Forgot password? Click here to reset