2850 search results - page 250 / 570 » On Timed Models and Full Abstraction |
167
click to vote
SEMWEB
2005
Springer
16 years 11 days ago
2005
Springer
This paper extends the model theory of RDF with rules, placing an emphasis on integration with OWL and decidability of entailstart from an abstract syntax that views a rule as a pa...
183
click to vote
IDEAL
2004
Springer
16 years 7 days ago
2004
Springer
Abstract— The paper presents an efficient construction algorithm for obtaining sparse kernel density estimates based on a regression approach that directly optimizes model gener...
213
click to vote
LPNMR
2004
Springer
16 years 7 days ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
201
click to vote
RULEML
2004
Springer
16 years 7 days ago
2004
Springer
Abstract. Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is, among others, useful for ontology i...
193
click to vote
SEMWEB
2004
Springer
16 years 7 days ago
2004
Springer
Abstract. Building user-friendly GUIs for browsing and filtering RDF/S description bases while exploiting in a transparent way the expressiveness of declarative query/view language...