Sciweavers

7109 search results - page 125 / 1422
» Process Algebra with Combinators
Sort
View
ECSQARU
2009
Springer
15 years 1 months ago
Soft Constraints Processing over Divisible Residuated Lattices
We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semanti...
Simone Bova
TLCA
2007
Springer
15 years 9 months ago
Weakly Distributive Domains
In our previous work [17] we have shown that for any ω-algebraic meet-cpo D, if all higher-order stable function spaces built from D are ω-algebraic, then D is finitary. This ac...
Ying Jiang, Guo-Qiang Zhang
140
Voted
ESOP
2001
Springer
15 years 8 months ago
Modeling an Algebraic Stepper
Programmers rely on the correctness of the tools in their programming environments. In the past, semanticists have studied the correctness of compilers and compiler analyses, which...
John Clements, Matthew Flatt, Matthias Felleisen
JAR
1998
134views more  JAR 1998»
15 years 3 months ago
Integrating Computer Algebra into Proof Planning
Mechanized reasoning systems and computer algebra systems have different objectives. Their integration is highly desirable, since formal proofs often involve both of the two differ...
Manfred Kerber, Michael Kohlhase, Volker Sorge
201
Voted
SIGMOD
2005
ACM
164views Database» more  SIGMOD 2005»
16 years 3 months ago
RankSQL: Query Algebra and Optimization for Relational Top-k Queries
This paper introduces RankSQL, a system that provides a systematic and principled framework to support efficient evaluations of ranking (top-k) queries in relational database syst...
Chengkai Li, Kevin Chen-Chuan Chang, Ihab F. Ilyas...