On Counting Propositional Logic

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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Antonelli, Melissa, Lago, Ugo Dal, Pistone, Paolo
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computational Complexity Computer Science - Logic in Computer Science Computer Science - Programming Languages
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!