Sciweavers

3335 search results - page 471 / 667
» Grid result checking
Sort
View
IJCAI
2003
15 years 7 months ago
Learning Minesweeper with Multirelational Learning
Minesweeper is a one-person game which looks deceptively easy to play, but where average human performance is far from optimal. Playing the game requires logical, arithmetic and p...
Lourdes Peña Castillo, Stefan Wrobel
SLP
1993
110views more  SLP 1993»
15 years 7 months ago
Logic Program Specialisation With Deletion of Useless Clauses
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
D. Andre de Waal, John P. Gallagher
ENTCS
2006
103views more  ENTCS 2006»
15 years 5 months ago
Supporting SAT based BMC on Finite Path Models
The standard translation of a Bounded Model Checking (BMC) instance into a satisfiability problem, (a.k.a SAT), might produce misleading results in the case when the model under v...
Daniel Geist, Mark Ginzburg, Yoad Lustig, Ishai Ra...
CORR
2007
Springer
104views Education» more  CORR 2007»
15 years 5 months ago
Searching for low weight pseudo-codewords
— Belief Propagation (BP) and Linear Programming (LP) decodings of Low Density Parity Check (LDPC) codes are discussed. We summarize results of instanton/pseudo-codeword approach...
Michael Chertkov, Mikhail G. Stepanov
JFP
2008
125views more  JFP 2008»
15 years 5 months ago
Types and trace effects of higher order programs
This paper shows how type effect systems can be combined with model-checking techniques to produce powerful, automatically verifiable program logics for higher order programs. The...
Christian Skalka, Scott F. Smith, David Van Horn