69 search results - page 3 / 14 » Modelling for Lazy Clause Generation |
CCECE
2006
IEEE
14 years 2 months ago
2006
IEEE
Impenetrable doors are often quite common in virtual worlds. This is especially apparent in video games boasting large urban environments. Although there are often enterable build...
ACL
1992
13 years 9 months ago
1992
This paper presents an analysis of purpose clauses in the context of instruction understanding. Such analysis shows that goals affect the interpretation and / or execution of acti...
DAC
2005
ACM
13 years 10 months ago
2005
ACM
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
CADE
2002
Springer
14 years 9 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
ICLP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...