Sciweavers

584 search results - page 97 / 117
» Logic Programs as term Rewriting Systems
Sort
View
78
Voted
ISMIS
2003
Springer
15 years 2 months ago
Enacting an Agent-Based Digital Self in a 24x7 Web Services World
As broadband access to the Internet becomes pervasive, the need for a 24 hours a day, seven days a week (24x7) interface within the client devices, requires a level of sophisticati...
Steve Goschnick
ERLANG
2007
ACM
15 years 1 months ago
A language for specifying type contracts in Erlang and its interaction with success typings
We propose a small extension of the ERLANG language that allows programmers to specify contracts with type information at the level of individual functions. Such contracts are opt...
Miguel Jimenez, Tobias Lindahl, Konstantinos F. Sa...
POPL
2005
ACM
15 years 10 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko
MIDDLEWARE
2005
Springer
15 years 3 months ago
Managing the follow-me semantics to build large-scale pervasive applications
In this paper, we present the concept of follow-me semantics of the large-scale pervasive application and discuss the features and services to its implementation based on the inte...
Iara Augustin, Adenauer C. Yamin, Cláudio F...
89
Voted
JCP
2006
91views more  JCP 2006»
14 years 9 months ago
The Matching Predicate and a Filtering Scheme Based on Matroids
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitso...