2845 search results - page 304 / 569 » Constraints over Ontologies |
200
Voted
ICLP
2009
Springer
16 years 1 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
82
Voted
CHI
2009
ACM
16 years 1 months ago
2009
ACM
CT The novel experience Anywhere allowed participants to explore an urban area, tying together information not normally available, new points of views and interaction embedded into...
133
Voted
VLSID
2008
IEEE
16 years 1 months ago
2008
IEEE
Today's customizable processors allow the designer to augment the base processor with custom accelerators. By choosing appropriate set of accelerators, designer can significa...
86
Voted
CHI
2002
ACM
16 years 1 months ago
2002
ACM
Title of Dissertation: INTERACTIVE GRAPHICAL QUERYING OF TIME SERIES AND LINEAR SEQUENCE DATA SETS Harry Hochheiser, Doctor of Philosophy, 2003 Dissertation directed by: Professor...
82
Voted
CADE
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. In the context of combinations of theories with disjoint signatures, we classify the component theories according to the decidability of constraint satisability problems ...