Sciweavers

3154 search results - page 229 / 631
» Computing Closed Skycubes
Sort
View
KR
1998
Springer
15 years 10 months ago
Using an Expressive Description Logic: FaCT or Fiction?
Description Logics form a family of formalisms closely related to semantic networks but with the distinguishing characteristic that the semantics of the concept description langua...
Ian Horrocks
ECP
1997
Springer
102views Robotics» more  ECP 1997»
15 years 10 months ago
Event Calculus Planning Revisited
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...
Murray Shanahan
ICDT
1997
ACM
90views Database» more  ICDT 1997»
15 years 10 months ago
Adding Structure to Unstructured Data
We develop a new schema for unstructured data. Traditional schemas resemble the type systems of programming languages. For unstructured data, however, the underlying type may be mu...
Peter Buneman, Susan B. Davidson, Mary F. Fernande...
POPL
1994
ACM
15 years 10 months ago
Call Forwarding: A Simple Interprocedural Optimization Technique for Dynamically Typed Languages
This paper discusses call forwarding, a simple interprocedural optimization technique for dynamically typed languages. The basic idea behind the optimization is straightforward: n...
Koenraad De Bosschere, Saumya K. Debray, David Gud...
GECCO
2010
Springer
156views Optimization» more  GECCO 2010»
15 years 10 months ago
Elementary landscape decomposition of the quadratic assignment problem
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...
J. Francisco Chicano, Gabriel Luque, Enrique Alba