2540 search results - page 224 / 508 » Abstract Logics as Dialgebras |
158
click to vote
TABLEAUX
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. We define sequent-style calculi for nominal tense logics characterized by classes of modal frames that are first-order definable by certain Π0 1 -formulae and Π0 2 -...
233
Voted
ALP
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
196
click to vote
CCL
1994
Springer
15 years 10 months ago
1994
Springer
Abstract: This paper describes the application of CLP (constraint logic programming) to several digital circuit design problems. It is shown that logic programming together with ef...
177
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Conditional Random Fields (CRFs) provide a powerful instrument for labeling sequences. So far, however, CRFs have only been considered for labeling sequences over flat al...
157
click to vote
FPL
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. In this paper we outline a procedure to determine appropriate partitioning of programmable logic and interconnect area to minimize overall device area across a broad rang...