Complexity of the consistency problem for certain post classes

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 31, Issue 2, 2001, Pages 251-253

  Shmulevich, I ^a   Gabbouj, M ^a   Astola, J ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

Computational complexity; Computational learning theory; Consistency problem; Monotone Boolean function; Post class

Indexed keywords

APPROXIMATION THEORY; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; CONFORMAL MAPPING; MEDICAL APPLICATIONS; POLYNOMIALS; PROBLEM SOLVING; RELIABILITY;

BREAST CANCER DIAGNOSIS; CONSISTENSY PROBLEM; POLYNOMIAL-TIME SOLVABLE; POST CLASSES;

LEARNING SYSTEMS;

EID: 0035309535     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/3477.915348     Document Type: Letter

References (15)

1. Learning regular sets from queries and counterexamples
2. Error-free and best-fit extensions of partially defined Boolean functions
3. Monotonicity and logical analysis of data: A mechanism for evaluation of mammographic and clinical data
4. How can AI procedures become more effective for manufacturing?
5. Interactive learning of monotone Boolean functions
6. On the completeness of systems of unreliable elements which realize functions of the algebra of logic
7. On the complexity of circuits in some bases, containing nontrivial elements with zero weights
8. Introduction to a general theory of elementary propositions
9. The knowledge acquisition problem in monotone Boolean systems
10. A theory of the learnable
11. Optimal weighted median filtering under structural constraints
12. Discovery of decision rules for breast cancer diagnosis