24 search results - page 1 / 5 » Towards an Efficient SAT Encoding for Temporal Reasoning |
CP
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. In this paper, we investigate how an IA network can be effectively encoded into the SAT domain. We propose two basic approaches to modelling an IA network as a CSP: one r...
AI
2008
Springer
13 years 5 months ago
2008
Springer
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
AIPS
2008
13 years 7 months ago
2008
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
AAAI
2006
13 years 6 months ago
2006
We present a new efficient algorithm for obtaining utilitarian optimal solutions to Disjunctive Temporal Problems with Preferences (DTPPs). The previous state-of-the-art system ac...
SIGSOFT
2007
ACM
14 years 5 months ago
2007
ACM
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...