Tutorial: Complexity of Many-Valued Logics

Authors:
Affiliations:
Venue:
ISMVL '01 Proceedings of the 31st IEEE International Symposium on Multiple-Valued Logic
Year:
2001

Citing 0
Cited 5

Polarity-based stochastic local search algorithms for non-clausal satisfiability

Beyond two
Complexity of many-valued logics

Beyond two
Introduction to the Maximum Solution Problem

Complexity of Constraints
Reducing propositional theories in equilibrium logic to logic programs

EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
Generalised integer programming based on logically defined relations

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract