2035 search results - page 24 / 407 » On the complexity of stratified logics |
123
click to vote
FPGA
1997
ACM
15 years 10 months ago
1997
ACM
Logic emulation is a technique that uses dynamically reprogrammable systems for prototyping and design veri cation. Using an emulator, designers can realize designs through a soft...
155
click to vote
CORR
2002
Springer
15 years 5 months ago
2002
Springer
The Inductive Logic Programming community has considered proof-complexity and model-complexity, but, until recently, size-complexity has received little attention. Recently a chal...
135
click to vote
MFCS
2009
Springer
16 years 19 days ago
2009
Springer
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...
153
click to vote
EUROCOLT
1999
Springer
15 years 10 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
126
click to vote
LICS
2007
IEEE
16 years 10 days ago
2007
IEEE
Typing of lambda-terms in Elementary and Light Affine Logic (EAL , LAL resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL ...