4480 search results - page 190 / 896 » Prototyping Completion with Constraints Using Computational ... |
142
click to vote
VRML
1997
ACM
15 years 10 months ago
1997
ACM
This paper describes the use of the Virtual Reality Modeling Language (VRML) in the VIM - Visual Interface to Manufacturing system. The VIM prototype demonstrates the technical fe...
149
click to vote
WOLLIC
2009
Springer
16 years 1 months ago
2009
Springer
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-fr...
187
click to vote
CHI
1997
ACM
15 years 10 months ago
1997
ACM
The components of the World Wide Web, which we call the World Wide Web Shell, provide a framework for collaborative application development in much the same way as an expert syste...
188
click to vote
AGP
1999
IEEE
15 years 10 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
166
click to vote
SIGMOD
2008
ACM
15 years 6 months ago
2008
ACM
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...