Incremental learning of logic programs

Author(s):  
M. R. K. Krishna Rao
Author(s):  
C. Ferri-Ramírez ◽  
J. Hernández-Orallo ◽  
M.J. Ramírez-Quintana

2010 ◽  
Author(s):  
Gwen A. Frishkoff ◽  
Kevyn Collins-Thompson ◽  
Charles A. Perfetti

2018 ◽  
Vol 44 (10) ◽  
pp. 1586-1602 ◽  
Author(s):  
Franziska Kurtz ◽  
Herbert Schriefers ◽  
Andreas Mädebach ◽  
Jörg D. Jescheniak

1990 ◽  
Author(s):  
Chitta Baral ◽  
Jorge Lobo ◽  
Jack Minker
Keyword(s):  

1987 ◽  
Vol 10 (1) ◽  
pp. 1-33
Author(s):  
Egon Börger ◽  
Ulrich Löwen

We survey and give new results on logical characterizations of complexity classes in terms of the computational complexity of decision problems of various classes of logical formulas. There are two main approaches to obtain such results: The first approach yields logical descriptions of complexity classes by semantic restrictions (to e.g. finite structures) together with syntactic enrichment of logic by new expressive means (like e.g. fixed point operators). The second approach characterizes complexity classes by (the decision problem of) classes of formulas determined by purely syntactic restrictions on the formation of formulas.


Sign in / Sign up

Export Citation Format

Share Document