Sciweavers

241 search results - page 17 / 49
» Bounded Nondeterminism of Logic Programs
Sort
View
SYNASC
2005
IEEE
129views Algorithms» more  SYNASC 2005»
14 years 1 months ago
Logic Restructuring for Delay Balancing in Wave-Pipelined Circuits: An Integer Programming Approach
In this paper we apply integer programming (IP) based techniques to the problem of delay balancing in wave-pipelined circuits. The proposed approach considers delays, as well as f...
Srivastav Sethupathy, Nohpill Park, Marcin Paprzyc...
ASP
2001
Springer
13 years 11 months ago
Effect of knowledge representation on model based planning: experiments using logic programming encodings
In this paper we implement planning using answer set programming. We consider the action language A and its extensions. We show that when the domain is described using richer feat...
Le-Chi Tuan, Chitta Baral
CADE
2002
Springer
14 years 8 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
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 ...
Harald Rueß, Leonardo Mendonça de Mou...
ICSE
2010
IEEE-ACM
13 years 9 months ago
DETERMIN: inferring likely deterministic specifications of multithreaded programs
The trend towards multicore processors and graphic processing units is increasing the need for software that can take advantage of parallelism. Writing correct parallel programs u...
Jacob Burnim, Koushik Sen
SIGSOFT
2009
ACM
14 years 8 months ago
Asserting and checking determinism for multithreaded programs
The trend towards processors with more and more parallel cores is increasing the need for software that can take advantage of parallelism. The most widespread method for writing p...
Jacob Burnim, Koushik Sen