8766 search results - page 455 / 1754 » Functional logic programming |
145
click to vote
ISCAS
2006
IEEE
15 years 10 months ago
2006
IEEE
— Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synt...
124
Voted
FLAIRS
2007
15 years 6 months ago
2007
This paper describes the use of two machine learning techniques, naive Bayes and decision trees, to address the task of assigning function tags to nodes in a syntactic parse tree....
135
click to vote
ICFP
2010
ACM
15 years 5 months ago
2010
ACM
Programmers reason about their programs using a wide variety of formal and informal methods. Programmers in untyped languages such as Scheme or Erlang are able to use any such met...
141
click to vote
FROCOS
2007
Springer
15 years 10 months ago
2007
Springer
In abstract algebra, a structure is said to be Noetherian if it does not admit infinite strictly ascending chains of congruences. In this paper, we adapt this notion to first-ord...
187
click to vote
DAC
2006
ACM
16 years 5 months ago
2006
ACM
- Classical two-variable symmetries play an important role in many EDA applications, ranging from logic synthesis to formal verification. This paper proposes a complete circuit-bas...