1743 search results - page 254 / 349 » Generalized Modal Satisfiability |
145
click to vote
AIPS
2006
15 years 6 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...
143
click to vote
FLAIRS
2004
15 years 6 months ago
2004
We discuss description and reasoning over regions. We have proposed a system called SRCC that integrates integration of spatial and semantic data. SRCC can describe and reason abo...
138
Voted
IADIS
2004
15 years 6 months ago
2004
This paper presents an analysis of the degree to which attitudes towards an Internet-based simulation depend on how satisfied participants are with the software used. The theoreti...
WSC
2004
15 years 6 months ago
2004
Simulation composability is a difficult capability to achieve due to the challenges of creating components, selecting combinations of components, and integrating the selected comp...
124
click to vote
AAAI
2000
15 years 6 months ago
2000
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...