3566 search results - page 362 / 714 » Signed Logic Programs |
120
click to vote
CTCS
1989
Springer
15 years 7 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
128
click to vote
HPCA
2008
IEEE
16 years 4 months ago
2008
IEEE
The continued scaling of device dimensions and the operating voltage reduces the critical charge and thus natural noise tolerance level of transistors. As a result, circuits can p...
137
click to vote
IJCAI
1993
15 years 5 months ago
1993
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
141
click to vote
IOR
2007
15 years 3 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
151
click to vote
ICLP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We instrument a higher-order logic programming search procedure to generate and check small proof witnesses for the Twelf system, an implementation of the logical framewo...