4066 search results - page 117 / 814 » Almost Complete Sets |
171
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show ...
157
click to vote
ADG
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. This paper describes a complete implementation of Ritt-Wu's characteristic sets method in the Maple system. The implemented algorithms include those with variants fo...
164
click to vote
ECAI
2004
Springer
15 years 11 months ago
2004
Springer
This paper constructs a logic of soft constraints where the set of degrees of preference forms a partially ordered set. When the partially ordered set is a distributive lattice, th...
193
click to vote
LPNMR
2005
Springer
15 years 12 months ago
2005
Springer
Loops and the corresponding loop formulas play an important role in answer set programming. On the one hand, they are used for guaranteeing correctness and completeness in SAT-base...
165
click to vote
DAM
2008
15 years 6 months ago
2008
Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a pa...