Sciweavers

2911 search results - page 123 / 583
» A Logic of Graph Constraints
Sort
View
ESWS
2007
Springer
15 years 6 months ago
Vague Knowledge Bases for Matchmaking in P2P E-Marketplaces
In this paper we propose an approach to semantic matchmaking that exploits various knowledge representation technologies to find most promising partners in peer-to-peer e-marketpl...
Azzurra Ragone, Umberto Straccia, Tommaso Di Noia,...
LOPSTR
1997
Springer
15 years 4 months ago
Implicit Program Synthesis by a Reversible Metainterpreter
Synthesis of logic programs is considered as a special instance of logic programming. We describe experience made within a logical metaprogramming environment whose central compone...
Henning Christiansen
ENTCS
2008
106views more  ENTCS 2008»
15 years 22 days ago
Towards a Sharing Strategy for the Graph Rewriting Calculus
The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...
Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, C...
70
Voted
AIMS
2007
Springer
15 years 6 months ago
Understanding Promise Theory Using Rewriting Logic
We describe our effort to evaluate the syntax and constraints of Promise Theory using a tool developed in the Maude framework. Through the development of a Maude module we are able...
Kyrre M. Begnum, Mark Burgess
87
Voted
AIMSA
2008
Springer
15 years 7 months ago
Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models
Integrated modeling of temporal and logical constraints is important for solving real-life planning and scheduling problems. Logical constrains extend the temporal formalism by rea...
Roman Barták, Ondrej Cepek