884 search results - page 134 / 177 » A Proof Theory for DL-Lite |
104
click to vote
MLQ
2000
14 years 11 months ago
2000
In Zermelo-Fraenkel set theory with the axiom of choice every set has the same cardinal number as some ordinal. Von Rimscha has weakened this condition to "Every set has the s...
111
click to vote
CADE
2004
Springer
16 years 3 days 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...
102
click to vote
STOC
2003
ACM
16 years 3 days ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
101
click to vote
TPHOL
2007
IEEE
15 years 6 months ago
2007
IEEE
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
DRM
2007
Springer
15 years 6 months ago
2007
Springer
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...