3032 search results - page 365 / 607 » Description Logic Rules |
138
click to vote
TGC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We propose and discuss foundations for programmable overlay networks and overlay computing systems. Such overlays are built over a large number of distributed computation...
133
Voted
ICFP
2010
ACM
15 years 4 months ago
2010
ACM
Programmers reason about their programs using a wide variety of formal and informal methods. Programmers in untyped languages such as Scheme or Erlang are able to use any such met...
114
click to vote
TCS
2008
15 years 3 months ago
2008
Density elimination, a close relative of cut elimination, consists of removing applications of the Takeuti-Titani density rule from derivations in Gentzen-style (hypersequent) cal...
132
click to vote
ECRA
2002
15 years 3 months ago
2002
This paper presents a formal and executable approach to capture the behaviour of parties involved in a negotiation. A party is modeled as a negotiating agent composed of a communi...
145
click to vote
RR
2010
Springer
15 years 2 months ago
2010
Springer
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...