Sciweavers

400 search results - page 34 / 80
» Backtracking
Sort
View
COMGEO
2004
ACM
13 years 10 months ago
A global approach to automatic solution of jigsaw puzzles
We present a new algorithm for automatically solving jigsaw puzzles byshapealone.Thealgorithm cansolvemore difficult puzzlesthan couldbesolved before, without the use of backtracki...
David Goldberg, Christopher Malon, Marshall W. Ber...
ENTCS
2000
123views more  ENTCS 2000»
13 years 10 months ago
Defining Standard Prolog in Rewriting Logic
The coincidence between the model-theoretic and the procedural semantics of SLDresolution does not carry over to a Prolog system that also implements non-logical features like cut...
Marija Kulas, Christoph Beierle
DLS
2010
146views Languages» more  DLS 2010»
13 years 8 months ago
Experiences with an icon-like expression evaluation system
The design of the Icon programming language's expression evaluation system, which can perform limited backtracking, was unique amongst imperative programming languages when c...
Laurence Tratt
JSAT
2010
83views more  JSAT 2010»
13 years 5 months ago
QuBE7.0
In this paper we outline QuBE7's main features, describing first the options of the preprocessors, and then giving some details about how the core search-based solver (i) per...
Enrico Giunchiglia, Paolo Marin, Massimo Narizzano
AGP
2003
IEEE
14 years 4 months ago
Solving Hard Disjunctive Logic Programs Faster (Sometimes)
Disjunctive Logic Programming (DLP) under the consistent answer set semantics is an advanced formalism for knowledge representation and reasoning. It is, under widely believed assu...
Gerald Pfeifer