Sciweavers

1989 search results - page 33 / 398
» Set functions for functional logic programming
Sort
View
20
Voted
CORR
2008
Springer
142views Education» more  CORR 2008»
13 years 7 months ago
Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
Paul Tarau
DAC
2003
ACM
14 years 8 months ago
A hybrid SAT-based decision procedure for separation logic with uninterpreted functions
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
Sanjit A. Seshia, Shuvendu K. Lahiri, Randal E. Br...
RSCTC
2000
Springer
147views Fuzzy Logic» more  RSCTC 2000»
13 years 11 months ago
Towards Rough Neural Computing Based on Rough Membership Functions: Theory and Application
This paper introduces a neural network architecture based on rough sets and rough membership functions. The neurons of such networks instantiate approximate reasoning in assessing ...
James F. Peters, Andrzej Skowron, Liting Han, Shee...
DFG
2004
Springer
14 years 1 months ago
A Unifying Semantics for Sequential Function Charts
Programmable Logic Controllers (PLC) are widely used as device controllers for assembly lines, chemical processes, or power plants. Sequential Function Charts (SFC) form one of the...
Nanette Bauer, Ralf Huuck, Ben Lukoschus, Sebastia...
PLDI
2010
ACM
14 years 21 days ago
Resolving and exploiting the k-CFA paradox: illuminating functional vs. object-oriented program analysis
Low-level program analysis is a fundamental problem, taking the shape of “flow analysis” in functional languages and “points-to” analysis in imperative and object-oriente...
Matthew Might, Yannis Smaragdakis, David Van Horn