532 search results - page 70 / 107 » The Logic of Quasi-MV Algebras |
AIML
2004
13 years 11 months ago
2004
We are going to show that the standard notion of Kripke completeness is the strongest one among many provably distinct algebraically motivated completeness properties, some of whic...
PPDP
2007
Springer
14 years 4 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
CIDR
2009
13 years 11 months ago
2009
Recent excitement in the database community surrounding new applications--analytic, scientific, graph, geospatial, etc.--has led to an explosion in research on database storage sy...
PEPM
2007
ACM
14 years 4 months ago
2007
ACM
Having been convinced of the potential benefits of partial evaluation, we wanted to conduct some experiments in our favourite Computer Algebra System, Maple. Maple is a large lan...
VLDB
1992
ACM
14 years 1 months ago
1992
ACM
This paper considers the problem of adding list as a type constructor to an object-oriented data model. In particular, we are concerned with how lists in a database can be constru...