1818 search results - page 297 / 364 » Granularity-Adaptive Proof Presentation |
123
click to vote
CORR
2000
Springer
15 years 3 months ago
2000
Springer
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
128
Voted
JACM
2000
15 years 3 months ago
2000
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
105
click to vote
IJMMS
1998
15 years 3 months ago
1998
Clancey (1992) proposed the model-construction framework as a way to explain the reasoning of knowledge-based systems (KBSs), based on his realization that all KBSs construct impl...
140
Voted
SIAMDM
1998
15 years 3 months ago
1998
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
137
click to vote
JCT
2007
15 years 2 months ago
2007
A k-triangulation of a convex polygon is a maximal set of diagonals so that no k + 1 of them mutually cross in their interiors. We present a bijection between 2-triangulations of a...