2496 search results - page 113 / 500 » On covering by translates of a set |
192
click to vote
LOGCOM
2010
15 years 4 months ago
2010
In this paper, we propose an extension of Answer Set Programming (ASP) to support declarative reasoning on consumption and production of resources. We call the proposed extension ...
200
click to vote
NMR
2004
Springer
15 years 11 months ago
2004
Springer
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance bo...
163
click to vote
AAAI
2004
15 years 7 months ago
2004
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boo...
220
click to vote
AI
2004
Springer
15 years 6 months ago
2004
Springer
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
140
click to vote
DCC
2003
IEEE
16 years 6 months ago
2003
IEEE
Two ways of constructing maximal sets of mutually orthogonal Latin squares are presented. The first construction uses maximal partial spreads in PG(3, 4)\ PG(3, 2) with r lines, wh...