9730 search results - page 8 / 1946 » Relating models of backtracking |
AI
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
SAT
2004
Springer
15 years 3 months ago
2004
Springer
The finite model generation problem in the first-order logic is a generalization of the propositional satisfiability (SAT) problem. An essential algorithm for solving the proble...
ICALP
1997
Springer
15 years 1 months ago
1997
Springer
In this paper we develop a new elementary algorithm for model-checking infinite sequential processes, including context-free processes, pushdown processes, and regular graphs, tha...
162
click to vote
VLDB
2008
ACM
15 years 9 months ago
2008
ACM
This paper presents a probabilistic relational modelling (implementation) of the major probabilistic retrieval models. Such a high-level implementation is useful since it supports ...
AAAI
2008
14 years 12 months ago
2008