11160 search results - page 225 / 2232 » Incompleteness in a General Setting |
177
click to vote
WDAG
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
171
click to vote
ASP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Ordered Choice Logic Programming (OCLP) allows for preferencebased decision-making with multiple alternatives and without the burden of any form of negation. This complet...
194
click to vote
ASP
2003
Springer
15 years 11 months ago
2003
Springer
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
167
click to vote
ECSQARU
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. In this paper, we first investigate set semantics of propositional logic in terms of rough sets and discuss how truth values of propositions (sentences) can be interpret...
164
click to vote
TACS
1994
Springer
15 years 9 months ago
1994
Springer
Abstract. We have designed a programming logic based on an integration of functional programming languages with classical set theory. The logic merges a classical view of equality ...