193 search results - page 36 / 39 » Incremental logic rectification |
IJCAI
2003
13 years 9 months ago
2003
Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. However, the n...
CADE
2004
Springer
14 years 8 months ago
2004
Springer
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...
SIGMOD
2005
ACM
14 years 7 months ago
2005
ACM
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...
ICCAD
2003
IEEE
14 years 4 months ago
2003
IEEE
In the context of physical synthesis, large-scale standard-cell placement algorithms must facilitate incremental changes to layout, both local and global. In particular, flexible...
ATVA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...