Marco Cadoli's work on nonmonotonic reasoning

被引:0
作者
Eiter, Thomas [1 ]
Gottlob, Georg [2 ]
机构
[1] Vienna Univ Technol, Inst Informat Syst, Favoritenst 9-11, A-1040 Vienna, Austria
[2] Univ Oxford, Dept Comp Sci, Oxford, England
关键词
Approximate reasoning; circumscription; computational complexity; knowledge compilation; nonmonotonic reasoning; problem solving; succinct representation;
D O I
10.3233/IA-130040
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Marco Cadoli (5.12.1965 - 21.11.2006) was a well- known Italian Computer Scientist. This paper reviews his fundamental work in the area of nonmonotonic reasoning and also gives a very brief personal (and thus rather incomplete) account of his academic career and of his fruitful cooperation and interaction with the AI Group at TU Wien.
引用
收藏
页码:7 / 17
页数:11
相关论文
共 54 条
[11]  
Cadoli M., 1995, Fundamenta Informaticae, V23, P123
[12]  
Cadoli M., 1990, AAAI-90 Proceedings. Eighth National Conference on Artificial Intelligence, P550
[13]  
Cadoli M, 2000, J ARTIF INTELL RES, V13, P1
[14]   An algorithm to evaluate quantified Boolean formulae and its experimental evaluation [J].
Cadoli, M ;
Schaerf, M ;
Giovanardi, A ;
Giovanardi, M .
JOURNAL OF AUTOMATED REASONING, 2002, 28 (02) :101-142
[15]   On the complexity of entailment in propositional multivalued logics [J].
Cadoli, M ;
Schaerf, M .
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 1996, 18 (01) :29-50
[16]   NP-SPEC: an executable specification language for solving all problems in NP [J].
Cadoli, M ;
Ianni, G ;
Palopoli, L ;
Schaerf, A ;
Vasile, D .
COMPUTER LANGUAGES, 2000, 26 (2-4) :165-195
[17]  
Cadoli M., 1996, Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, P100
[18]  
Cadoli M, 1998, FIFTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-98) AND TENTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICAL INTELLIGENCE (IAAI-98) - PROCEEDINGS, P262
[19]   Default logic as a query language [J].
Cadoli, M ;
Eiter, T ;
Gottlob, G .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1997, 9 (03) :448-463
[20]   Circumscribing DATALOG: Expressive power and complexity [J].
Cadoli, M ;
Palopoli, L .
THEORETICAL COMPUTER SCIENCE, 1998, 193 (1-2) :215-244