5506 search results - page 234 / 1102 » Minimal Logic Programs |
173
click to vote
AMAST
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic sp...
118
click to vote
DAC
2003
ACM
16 years 5 months ago
2003
ACM
In some cases, minimum Sum-Of-Products (SOP) expressions of Boolean functions can be derived by detecting decomposition and observing the functional properties such as unateness, ...
139
click to vote
ILP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Logical Bayesian Networks (LBNs) have recently been introduced as another language for knowledge based model construction of Bayesian networks, besides existing languages...
230
click to vote
POPL
2002
ACM
16 years 4 months ago
2002
ACM
Functional logic overloading is a novel approach to userdefined overloading that extends Haskell's concept of type classes in significant ways. Whereas type classes are conce...
123
click to vote
DAC
2007
ACM
16 years 5 months ago
2007
ACM
The ability of modern SAT solvers to produce proofs of unsatisfiability for Boolean formulas has become a powerful tool for EDA applications. Proofs are generated from a resolve t...