Sciweavers

9730 search results - page 18 / 1946
» Relating models of backtracking
Sort
View
APAL
2010
98views more  APAL 2010»
13 years 11 months ago
Classical proof forestry
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
Willem Heijltjes
CONSTRAINTS
1998
112views more  CONSTRAINTS 1998»
13 years 10 months ago
Temporal Constraints: A Survey
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
Eddie Schwalb, Lluís Vila
DATE
2008
IEEE
85views Hardware» more  DATE 2008»
14 years 5 months ago
Improved Visibility in One-to-Many Trace Concretization
We present an improved algorithm for concretization of abstract eres in abstraction refinement-based invariant checking. The algorithm maps each transition of the abstract error ...
Kuntal Nanshi, Fabio Somenzi
PATAT
2004
Springer
151views Education» more  PATAT 2004»
14 years 4 months ago
Decomposition and Parallelization of Multi-resource Timetabling Problems
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of ...
Petr Slechta
SIMULATION
2002
103views more  SIMULATION 2002»
13 years 10 months ago
The Trend Cellular Automata Programming Environment
Trend is a two dimensional cellular automata programming environment with an integrated simulator and a compiler. Trend has many unique features such as simulation backtracking, c...
Hui-Hsien Chou, Wei Huang, James A. Reggia