The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Satisfiability in many-valued sentential logic is NP-complete
Theoretical Computer Science
A quantitative approach to logical inference
Decision Support Systems
A decidable first-order logic for knowledge representation
Journal of Automated Reasoning
Sequential circuit verification using symbolic model checking
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Automated deduction in multiple-valued logics
Automated deduction in multiple-valued logics
A constructive proof of McNaughton's theorem in infinite-valued logic
Journal of Symbolic Logic
Resolution-based theorem proving for many-valued logics
Journal of Symbolic Computation
On-line algorithms for satisfiability problems with uncertainty
Selected papers from the international workshop on Uncertainty in databases and deductive systems
Regular Article: The Complexity of McNaughton Functions of One Variable
Advances in Applied Mathematics
Resolution and model building in the infinite-valued calculus of Łukasiewicz
Theoretical Computer Science
Model checking
The SAT problem of signed CNF formulas
Labelled deduction
Switching Theory for Logic Synthesis
Switching Theory for Logic Synthesis
Finiteness in Infinite-Valued Σukasiewicz Logic
Journal of Logic, Language and Information
Incompleteness of a First-Order Gödel Logic and Some Temporal Logics of Programs
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
Phase Transitions in the Regular Random 3-SAT Problem
ISMIS '99 Proceedings of the 11th International Symposium on Foundations of Intelligent Systems
Comparison of the worst and best sum-of-products expressions for multiple-valued functions
ISMVL '97 Proceedings of the 27th International Symposium on Multiple-Valued Logic
Transformations between Signed and Classical Clause Logic
ISMVL '99 Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic
The 2-SAT Problem of Regular Signed CNF Formulas
ISMVL '00 Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic
Tutorial: Complexity of Many-Valued Logics
ISMVL '01 Proceedings of the 31st IEEE International Symposium on Multiple-Valued Logic
Complexity of Fuzzy Probability Logics
Fundamenta Informaticae
Automated theorem proving by resolution in non-classical logics
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
As is the case for other logics, a number of complexity-related questions can be posed in the context of many-valued logic. Some of these, such as the complexity of the sets of satisfiable and valid formulas in various logics, are completely standard; others only make sense in a many-valued context. In this overview I concentrate on two kinds of complexity problems related to many-valued logic: first, I discuss the complexity of the membership problem in various languages, such as the satisfiable, respectively, the valid formulas in some well-known logics. Second, I discuss the size of representations of many-valued connectives and quantifiers, because this has a direct impact on the complexity of many kinds of deduction systems. I include results on both propositional and on first-order logic.