Sciweavers

7167 search results - page 622 / 1434
» Answer Set Programming
Sort
View
CP
2009
Springer
16 years 7 months ago
Constraint-Based Graph Matching
Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. ...
Christine Solnon, Vianney le Clément, Yves ...
280
Voted
POPL
2008
ACM
16 years 6 months ago
Proving non-termination
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
Ashutosh Gupta, Thomas A. Henzinger, Rupak Majumda...
POPL
2006
ACM
16 years 6 months ago
Adventures in time and space
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
Norman Danner, James S. Royer
ICSE
2008
IEEE-ACM
16 years 6 months ago
MimEc: intelligent user notification of faults in the eclipse IDE
The earlier in the software process a fault is detected, the cheaper the cost of fixing the fault. Automated fault detection tools can provide developers with information througho...
Lucas Layman, Laurie A. Williams, Robert St. Amant
ICFP
2003
ACM
16 years 6 months ago
A sound and complete axiomatization of delimited continuations
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...
Yukiyoshi Kameyama, Masahito Hasegawa