532 search results - page 52 / 107 » The Logic of Quasi-MV Algebras |
105
click to vote
ICCAD
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper presents new methods for restructuring logic networks based on fast Boolean techniques. The basis for these are 1) a cut based view of a logic network, 2) exploiting th...
146
Voted
FLOPS
2010
Springer
15 years 8 months ago
2010
Springer
We present a general framework for generating SQL query test cases using Constraint Logic Programming. Given a database schema and a SQL view defined in terms of other views and s...
130
Voted
LOPSTR
1998
Springer
15 years 6 months ago
1998
Springer
Based on a variable-free combinatory form of definite clause logic programs we outline a methodology and supporting program environment CombInduce for inducing well-moded logic pro...
131
click to vote
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper presents a new and retargetable method to identify patterns of instructions with direct support in coarsegrained processing elements (PEs). The method uses a three-addr...
96
Voted
AGP
1993
IEEE
15 years 6 months ago
1993
IEEE
In this paper, we present an account of classical Logic Programming fixed-point semantics in terms of two standard categorical constructions in which the least Herbrand model is ...