968 search results - page 150 / 194 » A faster implementation of APlace |
154
click to vote
AAAI
2006
15 years 5 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
138
click to vote
AIPS
2006
15 years 5 months ago
2006
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
123
click to vote
CGVR
2006
15 years 5 months ago
2006
In this paper, we present the results of a comparative evaluation of a "virtual Lego" system against real Lego bricks with novice users. The virtual Lego system was desi...
162
click to vote
IJCAI
2001
15 years 5 months ago
2001
The AC-3 algorithm is a basic and widely used arc consistency enforcing algorithm in Constraint Satisfaction Problems (CSP). Its strength lies in that it is simple, empirically ef...
131
click to vote
MSV
2004
15 years 5 months ago
2004
A large number of applications can be represented by quantified Boolean formulas (QBF). Although evaluating QBF is NP-hard and thus very difficult, there has been significant progr...