New Complexity Results for Łukasiewicz Logic

Soft Computing - Germany
doi 10.1007/s00500-018-3365-9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Complexity Results for First-Order Two-Variable Logic With Counting

SIAM Journal on Computing
MathematicsComputer Science
2000English

Imprecise Probabilities, Bets and Functional Analytic Methods in Łukasiewicz Logic

Forum Mathematicum
MathematicsApplied Mathematics
2013English

A General View on Normal Form Theorems for Łukasiewicz Logic With Product

English

Duality, Projectivity, and Unification in Łukasiewicz Logic and MV-algebras

Annals of Pure and Applied Logic
Logic
2013English

Łukasiewicz Logics for Cooperative Games

Artificial Intelligence
LinguisticsLanguageArtificial Intelligence
2019English

Proof Complexity of Propositional Default Logic

Archive for Mathematical Logic
PhilosophyLogic
2011English

Proof Complexity of Propositional Default Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Normal Form Results for Default Logic

English

Computational Complexity of Input/Output Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy