Sciweavers

211 search results - page 14 / 43
» The Representation of Program Synthesis in Higher Order Logi...
Sort
View
AICOM
2006
105views more  AICOM 2006»
14 years 9 months ago
Evolutionary concept learning in First Order Logic: An overview
This paper presents an overview of recent systems for Inductive Logic Programming (ILP). After a short description of the two popular ILP systems FOIL and Progol, we focus on meth...
Federico Divina
84
Voted
ICCD
2002
IEEE
101views Hardware» more  ICCD 2002»
15 years 6 months ago
Improving the Efficiency of Circuit-to-BDD Conversion by Gate and Input Ordering
Boolean functions are fundamental to synthesis and verification of digital logic, and compact representations of Boolean functions have great practical significance. Popular repre...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
LOPSTR
1997
Springer
15 years 1 months ago
Development of Correct Transformation Schemata for Prolog Programs
Schema-based program transformation [8] has been proposed as an effective technique for the optimisation of logic programs. Schemata are applied to a logic program, mapping ineffi...
Julian Richardson, Norbert E. Fuchs
DATE
2000
IEEE
124views Hardware» more  DATE 2000»
15 years 1 months ago
On the Generation of Multiplexer Circuits for Pass Transistor Logic
Pass Transistor Logic has attracted more and more interest during last years, since it has proved to be an attractive alternative to static CMOS designs with respect to area, perf...
Christoph Scholl, Bernd Becker
DAC
2006
ACM
15 years 10 months ago
DAG-aware AIG rewriting a fresh look at combinational logic synthesis
This paper presents a technique for preprocessing combinational logic before technology mapping. The technique is based on the representation of combinational logic using And-Inve...
Alan Mishchenko, Satrajit Chatterjee, Robert K. Br...