3693 search results - page 331 / 739 » Splitting a Logic Program |
169
click to vote
CASCON
1997
15 years 8 months ago
1997
This paper describes the implementation of a reliable Get-Put interface written for a distributed memory environment. The asynchronous semantics of the Put as well as the split tr...
192
click to vote
ORL
2008
15 years 6 months ago
2008
A central result in the theory of integer optimization states that a system of linear diophantine equations Ax = b has no integral solution if and only if there exists a vector in...
138
click to vote
ATVA
2009
Springer
16 years 1 months ago
2009
Springer
We present a data symmetry reduction approach for model temporal-epistemic logic. The technique abstracts the epistemic indistinguishably relation for the knowledge operators, and ...
168
click to vote
CP
2005
Springer
16 years 5 days ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
138
click to vote
TBILLC
2005
Springer
16 years 3 days ago
2005
Springer
We implement the extension of the logical consequence relation to a partial order ≤ on arbitary types built from e (entities) and t (Booleans) that was given in [1], and the deï...