4513 search results - page 643 / 903 » Logic programming with satisfiability |
222
Voted
ICLP
2009
Springer
16 years 4 months ago
2009
Springer
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
120
click to vote
ICFP
2005
ACM
16 years 4 months ago
2005
ACM
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
155
click to vote
EUSFLAT
2009
15 years 1 months ago
2009
Abstract-- In this paper, we deal with the production and transportation planning of a household appliances manufacturer that has production facilities and central stores for resel...
128
Voted
DAC
2006
ACM
16 years 5 months ago
2006
ACM
Most FPGA technology mapping approaches either target Lookup Tables (LUTs) or relatively simple Programmable Logic Blocks (PLBs). Considering networks of PLBs during technology map...
127
click to vote
CCS
2009
ACM
16 years 4 months ago
2009
ACM
This paper proposes a D-algebra to compose decisions from multiple access control policies. Compared to other algebrabased approaches aimed at policy composition, D-algebra is the...