1888 search results - page 128 / 378 » Proof theory and computational analysis |
140
click to vote
MEMOCODE
2008
IEEE
15 years 7 months ago
2008
IEEE
While synchrony and asynchrony are two distinct concepts of concurrency theory, effective and formally defined embedded system design methodologies usually mix the best from both...
93
Voted
CLA
2004
15 years 2 months ago
2004
cessary to abstract it and eliminate the redundancy data. In this context, a method for data reduction based on the formal concept analysis is proposed in [16,17]. At the same time...
100
Voted
LATA
2009
Springer
15 years 7 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
115
Voted
COMMA
2006
15 years 2 months ago
2006
Abstract. In 2005, Gordon and Walton presented initial ideas for a computational model of defeasible argument [12, 26], which builds on and elaborates Walton's theory of argum...
DCG
2008
15 years 20 days ago
2008
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...