5499 search results - page 183 / 1100 » Generalized Rewrite Theories |
198
click to vote
TABLEAUX
2009
Springer
15 years 11 months ago
2009
Springer
Projection computation is a generalization of second-order quantifier elimination, which in turn is closely related to the computation of forgetting and of uniform interpolants. O...
219
click to vote
VLDB
1994
ACM
15 years 11 months ago
1994
ACM
Most declarative SQL-like query languagesfor object-oriented database systems (OOSQL) are orthogonal languages allowing for arbitrary nesting of expressions in the select-, from-,...
180
click to vote
RTA
2010
Springer
15 years 11 months ago
2010
Springer
In usual proof systems, like the sequent calculus, only a very limited way of combining proofs is available through the tree structure. We present in this paper a logicindependent ...
230
click to vote
ICPP
1991
IEEE
15 years 10 months ago
1991
IEEE
Data decomposition is probably the most successful method for generating parallel programs. In this paper a general framework is described for the automatic generation of parallel...
192
click to vote
DLOG
2007
15 years 9 months ago
2007
We present cq-programs, which enhance nonmonotonic description logics (dl-) programs by conjunctive queries (CQ) and union of conjunctive queries (UCQ) over Description Logics kno...