Sciweavers

1173 search results - page 92 / 235
» Program Derivation Using Analogy
Sort
View
143
Voted
ICCAD
1995
IEEE
114views Hardware» more  ICCAD 1995»
15 years 8 months ago
Sequential synthesis using S1S
Abstract—We propose the use of the logic S1S as a mathematical framework for studying the synthesis of sequential designs. We will show that this leads to simple and mathematical...
Adnan Aziz, Felice Balarin, Robert K. Brayton, Alb...
128
Voted
ENTCS
2010
88views more  ENTCS 2010»
15 years 2 months ago
Range and Set Abstraction using SAT
d Set Abstraction using SAT Edd Barrett Andy King School of Computing, University of Kent, CT2 7NF, UK Symbolic decision trees are not the only way to correlate the relationship b...
Edd Barrett, Andy King
KI
2008
Springer
15 years 4 months ago
Repairing Decision-Theoretic Policies Using Goal-Oriented Planning
In this paper we address the problem of how decision-theoretic policies can be repaired. This work is motivated by observations made in robotic soccer where decisiontheoretic polic...
Christoph Mies, Alexander Ferrein, Gerhard Lakemey...
155
Voted
LPNMR
2001
Springer
15 years 9 months ago
plp: A Generic Compiler for Ordered Logic Programs
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
James P. Delgrande, Torsten Schaub, Hans Tompits
ICSE
2007
IEEE-ACM
16 years 5 months ago
Path-Sensitive Inference of Function Precedence Protocols
Function precedence protocols define ordering relations among function calls in a program. In some instances, precedence protocols are well-understood (e.g., a call to pthread mut...
Murali Krishna Ramanathan, Ananth Grama, Suresh Ja...