Sciweavers

5818 search results - page 978 / 1164
» A reasonable Semantic Web
Sort
View
NMR
2004
Springer
15 years 12 months ago
Logic programs with annotated disjunctions
Current literature offers a number of different approaches to what could generally be called “probabilistic logic programming”. These are usually based on Horn clauses. Here, ...
Joost Vennekens, Sofie Verbaeten, Maurice Bruynoog...
AGENTCL
2003
Springer
15 years 12 months ago
Resolving Commitments among Autonomous Agents
Commitments are a powerful representation for modeling multiagent interactions. Previous approaches have considered the semantics of commitments and how to check compliance with th...
Ashok U. Mallya, Pinar Yolum, Munindar P. Singh
ASP
2003
Springer
15 years 12 months ago
Suitable Graphs for Answer Set Programming
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
Thomas Linke
ASP
2003
Springer
15 years 12 months ago
Using Nested Logic Programs for Answer Set Programming
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
Thomas Linke
ICCBR
2003
Springer
15 years 11 months ago
An Investigation of Generalized Cases
In the CBR literature from the past 25 years there is a considerable amount of research work that makes use of cases that are subspaces of some representation space rather than poi...
Kerstin Maximini, Rainer Maximini, Ralph Bergmann