Sciweavers

557 search results - page 48 / 112
» Useful Transformations in Answer set programming
Sort
View
COMPSAC
2003
IEEE
14 years 1 months ago
Incremental Transformation of Procedural Systems to Object Oriented Platforms
Over the past years, the reengineering of legacy software systems to object oriented platforms has received significant attention. In this paper, we present a generic re-engineeri...
Ying Zou, Kostas Kontogiannis
VLSID
2002
IEEE
177views VLSI» more  VLSID 2002»
14 years 8 months ago
RTL-Datapath Verification using Integer Linear Programming
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
Raik Brinkmann, Rolf Drechsler
PPDP
2009
Springer
14 years 2 months ago
Automatic refactoring of Erlang programs
This paper describes the design goals and current status of tidier, a software tool that tidies Erlang source code, making it cleaner, simpler, and often also more efficient. In ...
Konstantinos F. Sagonas, Thanassis Avgerinos
WLP
2000
Springer
13 years 11 months ago
A Dynamic Approach to Deductive Query Evaluation
In this paper, a dynamic approach to deductive query evaluation is presented which combines the e ects of di erent SIP strategies used for the magic set rewriting technique. Given...
Andreas Behrend
ISMVL
1999
IEEE
90views Hardware» more  ISMVL 1999»
14 years 7 days ago
Transformations between Signed and Classical Clause Logic
In the last years two automated reasoning techniques for clause normal form arose in which the use of labels are prominently featured: signed logic and annotated logic programming...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...