Sciweavers

226 search results - page 8 / 46
» A Language for the Compact Representation of Multiple Progra...
Sort
View
AUSAI
2004
Springer
14 years 29 days ago
Embedding Memoization to the Semantic Tree Search for Deciding QBFs
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
Mohammad GhasemZadeh, Volker Klotz, Christoph Mein...
CP
2009
Springer
14 years 2 months ago
Reasoning about Optimal Collections of Solutions
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
Tarik Hadzic, Alan Holland, Barry O'Sullivan
ICLP
2005
Springer
14 years 1 months ago
Small Proof Witnesses for LF
Abstract. We instrument a higher-order logic programming search procedure to generate and check small proof witnesses for the Twelf system, an implementation of the logical framewo...
Susmit Sarkar, Brigitte Pientka, Karl Crary
SCCC
1998
IEEE
13 years 11 months ago
Dynamic Programming as Frame for Efficient Parsing
The last few years have seen a renewal of interest in the consideration of dynamic programming in compiler technology. This is due to the compactness of the representations, which...
Manuel Vilares Ferro, Miguel A. Alonso, David Cabr...
AVI
2008
13 years 8 months ago
Visualizing program similarity in the Ac plagiarism detection system
Programming assignments are easy to plagiarize in such a way as to foil casual reading by graders. Graders can resort to automatic plagiarism detection systems, which can generate...
Manuel Freire