Computational complexity of infinite-valued Lukasiewicz propositional logic

Wagner, Hubert GND

lt is shown for infinite-valued Lukasiewicz propositional logic that the consequence relation is complete for coNP and that the consequence problem is Π₂-complete. Using nondeterministic Turing-reduction to linear programming a simplified proof for the NP-completeness of the satisfiability problem is given.

Vorschau

Zitieren

Zitierform:

Wagner, Hubert: Computational complexity of infinite-valued Lukasiewicz propositional logic. Hagen 1995. FernUniversität in Hagen.

Zugriffsstatistik

Gesamt

Volltextzugriffe:
Metadatenansicht:

12 Monate

Volltextzugriffe:
Metadatenansicht:

Rechte

Nutzung und Vervielfältigung:
Alle Rechte vorbehalten

Export

powered by MyCoRe