2303 search results - page 281 / 461 » On the logic of argumentation theory |
169
click to vote
CTCS
1989
Springer
15 years 10 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
162
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
175
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
A novel method to solve the state encoding problem in Signal Transition Graphs is presented. It is based on the structural theory of Petri nets and can be applied to large specifi...
154
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
The relationship between constraint-based mining and constraint programming is explored by showing how the typical constraints used in pattern mining can be formulated for use in ...
280
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...