Feasibility as a gradual notion

Autoři: Libor Běhounek
Rok vydání: 2013
Typ publikace: Abstrakt
Periodikum: LPAR-17-short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning
Projekty: Logické modely usuzovaní s vagními informacemi
Dynamické formální systémy
Bibliografická citace: BĚHOUNEK, Libor. Feasibility as a gradual notion. In: VORONKOV, A., SUTCLIFFE, G., BAAZ, M., FERMÜLLER, C., eds. LPAR-17-short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning. University of Manchester: EasyChair Conference System, 2013, S. 15-19. EPiC, 13. ISSN 2040-557X. Dostupné z: http://www.easychair.org/publications/?page=103502707
ID: 391890

Abstrakt

The notion of feasibility, applicable in various areas related to logic, is arguably of gradual nature - some tasks are more feasible than others. The possibility of modeling a gradual notion of feasibility in t-norm logics is brought forward and illustrated on the gradual notions of feasible number, feasible knowledge, feasible formula, and feasible computability.