Sciweavers

330 search results - page 33 / 66
» Open Problems in Logic and Games
Sort
View
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
14 years 8 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
FSTTCS
2007
Springer
14 years 2 months ago
Undirected Graphs of Entanglement 2
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
Walid Belkhir, Luigi Santocanale
CONTEXT
2007
Springer
14 years 2 months ago
The Role of Context in Image Interpretation
The problem we address in this paper is the role of context in the interpretation of images when pictures are used as queries. An image usually depicts several objects and is open...
Dag Elgesem, Joan C. Nordbotten
LPNMR
1999
Springer
14 years 9 days ago
On the Role of Negation in Choice Logic Programs
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...
Marina De Vos, Dirk Vermeir
IJCAI
2003
13 years 9 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