2540 search results - page 100 / 508 » Abstract Logics as Dialgebras |
162
click to vote
ICLP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Pruning operators, such as cut, are important to develop efficient logic programs as they allow programmers to reduce the search space and thus discard unnecessary compu...
167
click to vote
FCT
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
148
click to vote
EUSFLAT
2009
15 years 4 months ago
2009
Abstract This paper introduces a parallelization of fuzzy logicbased image processing using Graphics Processor Units (GPUs). Using an NVIDIA 8800 Ultra, a 126 time speed improvemen...
142
click to vote
MFCS
2009
Springer
16 years 1 months 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 ...
150
click to vote
ATVA
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...