Sciweavers

8768 search results - page 326 / 1754
» Generalizing the notion of support
Sort
View
RTA
2010
Springer
15 years 11 months ago
Proving Productivity in Infinite Data Structures
For a general class of infinite data structures including streams, binary trees, and the combination of finite and infinite lists, we investigate a notion of productivity. This ...
Hans Zantema, Matthias Raffelsieper
EUSFLAT
2003
15 years 9 months ago
Self-dual types of cycle-transitivity
A general framework for studying the transitivity of reciprocal relations is presented. The key feature is the cyclic evaluation of transitivity: triangles (i.e. any three points)...
Bernard De Baets, Hans De Meyer, Bart De Schuymer
AI
2010
Springer
15 years 7 months ago
Reasoning under inconsistency: A forgetting-based approach
In this paper, a fairly general framework for reasoning from inconsistent propositional bases is defined. Variable forgetting is used as a basic operation for weakening pieces of ...
Jérôme Lang, Pierre Marquis
191
Voted
JAR
2006
87views more  JAR 2006»
15 years 7 months ago
Elimination Transformations for Associative-Commutative Rewriting Systems
To simplify the task of proving termination and AC-termination of term rewriting systems, elimination transformations have been vigorously studied since the 1990's. Dummy elim...
Keiichirou Kusakari, Masaki Nakamura, Yoshihito To...
INFORMATICALT
2007
76views more  INFORMATICALT 2007»
15 years 7 months ago
Strongly Absolute Stability Problem of Descriptor Systems
Abstract. This paper considers Lur’e type descriptor systems (LDS). The concept of strongly absolute stability is defined for LDS and such a notion is a generalization of absolu...
Chunyu Yang, Qingling Zhang, Linna Zhou