Sciweavers

3440 search results - page 373 / 688
» Logics For Context-Free Languages
Sort
View
AAAI
2007
15 years 9 months ago
Partial Matchmaking using Approximate Subsumption
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
Heiner Stuckenschmidt
ATAL
2008
Springer
15 years 9 months ago
Verifying Social Expectations by Model Checking Truncated Paths
One approach to moderating the expected behaviour of agents in open societies is the use of explicit languages for defining norms, conditional commitments and/or social expectation...
Stephen Cranefield, Michael Winikoff
214
Voted
SWAP
2008
15 years 9 months ago
Exploiting Semantic Technology in Computational Logic-based Service Contracting
Dynamic composition of web services requires an automated step of contracting, i.e., the computation of a possibly fruitful interaction between two (or more) services, based on the...
Marco Alberti, Massimiliano Cattafi, Marco Gavanel...
IJIT
2004
15 years 8 months ago
Rule-Based Message Passing for Collaborative Application in Distributed Environments
In this paper, we describe a rule-based message passing method to support developing collaborative applications, in which multiple users share resources in distributed environments...
Wataru Yamazaki, Hironori Hiraishi, Fumio Mizoguch...
AAAI
2000
15 years 8 months ago
Solving Combinatorial Auctions Using Stochastic Local Search
Combinatorial auctions (CAs) have emerged as an important model in economics and show promise as a useful tool for tackling resource allocation in AI. Unfortunately, winner determ...
Holger H. Hoos, Craig Boutilier