Sciweavers

2386 search results - page 184 / 478
» Representing and Reasoning with Preferences
Sort
View
AGENTCL
2003
Springer
15 years 11 months ago
Nonmonotonic Commitment Machines
CHOPRA, AMIT KHUSHWANT. Nonmonotonic Commitment Machines. (Under the direction of Dr. Munindar P. Singh). Protocols in open and dynamic multiagent systems cannot be modeled via fo...
Amit K. Chopra, Munindar P. Singh
CSCLP
2008
Springer
15 years 8 months ago
Solving CSPs with Naming Games
Abstract. Constraint solving problems (CSPs) represent a formalization of an important class of problems in computer science. We propose here a solving methodology based on the nam...
Stefano Bistarelli, Giorgio Gosti

Book
376views
17 years 3 months ago
An Exploration of Random Processes for Engineers
"From an applications viewpoint, the main reason to study the subject of these notes is to help deal with the complexity of describing random, time-varying functions. A random...
Bruce Hajek
WWW
2004
ACM
16 years 7 months ago
A method for modeling uncertainty in semantic web taxonomies
We present a method for representing and reasoning with uncertainty in RDF(S) and OWL ontologies based on Bayesian networks. Categories and Subject Descriptors: I.2.4 Artificial I...
Eero Hyvönen, Markus Holi
AINA
2009
IEEE
16 years 1 months ago
Towards a Rational Approach for the Logical Modelling of Inhibition in Metabolic Networks
—This paper makes two contributions towards the logical modelling of inhibition in metabolic networks. First it exposes the logical inconsistency of an existing state-of-the-art ...
Oliver Ray