2501 search results - page 106 / 501 » Logics with Rank Operators |
103
Voted
DLT
2004
15 years 2 months ago
2004
A fragment of linear time temporal logic (LTL) is presented. It is proved that the satisfiability problem for this fragment is NPcomplete. The fragment is larger than previously kn...
84
Voted
IGPL
2008
15 years 25 days ago
2008
We study a logic whose formulae are interpreted as properties of a finite set over some universe. The language is propositional, with two unary operators inclusion and extension, ...
81
Voted
EUSFLAT
2009
14 years 10 months ago
2009
We present in this paper some properties of k-Lipschitz quasi-arithmetic means. The Lipschitz aggregation operations are stable with respect to input inaccuracies, what is a very i...
119
Voted
DIAGRAMS
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. The spider diagram logic forms a fragment of constraint diagram logic and is designed to be primarily used as a diagrammatic software specification tool. Our interest is ...
97
Voted
CORR
2008
Springer
15 years 27 days ago
2008
Springer
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...