Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 14 (1998), S. 0 
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: A clear understanding and formalization of actions is essential to computing, and especially so to reasoning about and constructing intelligent agents. Several approaches have been proposed over the years. However, most approaches concentrate on the causes and effects of actions, but do not give general characterizations of actions themselves. A useful formalization of actions would be based on a general, possibly nondiscrete, model of time that allows branching (to capture agents’ choices). A desirable formalization would also allow actions to be of arbitrary duration and would permit multiple agents to act concurrently. We develop a branching-time framework that allows great flexibility in how time and action are modeled. We motivate and formalize several coherence constraints on our models, which capture some nice intuitions and validate some useful inferences relating actions with time.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Boston, USA and Oxford, UK : Blackwell Publishers Inc.
    Computational intelligence 18 (2002), S. 0 
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: One of the major challenges for electronic commerce is how to establish a relationship of trust between different parties. Establishing trust is nontrivial, because the traditional physical or social means of trust cannot apply directly in virtual settings. In many cases, the parties involved may not ever have interacted before. Reputation systems seek to address the development of trust by recording the reputations of different parties. However, most existing reputation systems are restricted to individual market websites. Further, relevant information about a party may come from several websites and from interactions that were not mediated by any website.This paper considers the problem of automatically collecting ratings about a given party from others. Our approach involves a distributed agent architecture and adapts the mathematical theory of evidence to represent and propagate the ratings that participants give to each other. When evaluating the trustworthiness of a given party, a peer combines its local evidence (based on direct prior interactions with the party) with the testimonies of others regarding the same party. This approach satisfies certain important properties of distributed reputation management and is experimentally evaluated through simulations.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Artificial intelligence and law 7 (1999), S. 97-113 
    ISSN: 1572-8382
    Keywords: commitments ; multiagent systems ; norms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Law
    Notes: Abstract Social commitments have long been recognized as an important concept for multiagent systems. We propose a rich formulation of social commitments that motivates an architecture for multiagent systems, which we dub spheres of commitment. We identify the key operations on commitments and multiagent systems. We distinguish between explicit and implicit commitments. Multiagent systems, viewed as spheres of commitment (SoComs), provide the context for the different operations on commitments. Armed with the above ideas, we can capture normative concepts such as obligations, taboos, conventions, and pledges as different kinds of commitments. In this manner, we synthesize ideas from multiagent systems, particularly the idea of social context, with ideas from ethics and legal reasoning, specifically that of directed obligations in the Hohfeldian tradition.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Journal of philosophical logic 22 (1993), S. 513-544 
    ISSN: 1573-0433
    Source: Springer Online Journal Archives 1860-2000
    Topics: Philosophy
    Notes: Abstract Intentions are an important concept in Artificial Intelligence and Cognitive Science. We present a formal theory of intentions and beliefs based on Discourse Representation Theory that captures many of their important logical properties. Unlike possible worlds approaches, this theory does not assume that agents are perfect reasoners, and gives a realistic view of their internal architecture; unlike most representational approaches, it has anobjective semantics, and does not rely on anad hoc labeling of the internal states of agents. We describe a minimal logic for intentions and beliefs that is sound and complete relative to our semantics. We discuss several additional axioms, and the constraints on the models that validate them.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    facet.materialart.
    Unknown
    Dordrecht : Periodicals Archive Online (PAO)
    Journal of philosophical logic. 22:5 (1993:Oct.) 513 
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Autonomous agents and multi-agent systems 3 (2000), S. 107-132 
    ISSN: 1573-7454
    Keywords: coordination ; development and engineering methodologies
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract As agents move into ever more important applications, there is a natural growth in interest in techniques for synthesizing multiagent systems. We describe an approach for engineering the coordination requirements of a multiagent system based on an analysis of conversation instances extracted from usage scenarios. This approach exploits the notion of Dooley graphs that were recently introduced to the multiagent systems community from the linguistics and discourse analysis literature. We show how, with a few key modifications, Dooley graphs can be used to generate coordination requirements and constraints on the behavior models of the agents participating in a multiagent system. Our present approach is embodied in the context of our recent work on a distributed coordination service for heterogeneous, autonomous agents. This approach takes as input (a) agent skeletons, giving compact descriptions of the given agents in terms of their events that are significant for coordination, as well as (b) relationships among the events occurring in these skeletons. A natural question is how may the skeletons and relationships be produced in the first place. It turns out that a methodology that begins with Dooley graphs can readily yield the skeletons and relationships needed to achieve the desired coordination. Consequently, our approach combines the benefits of an intuitive methodology with a formal and distributed framework for developing multiagent systems from autonomous agents.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Autonomous agents and multi-agent systems 2 (1999), S. 217-236 
    ISSN: 1573-7454
    Keywords: commitments ; protocols ; causality ; temporal logic ; formal methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Interaction protocols are specific, often standard, constraints on the behaviors of autonomous agents in a multiagent system. Protocols are essential to the functioning of open systems, such as those that arise in most interesting web applications. A variety of common protocols in negotiation and electronic commerce are best treated as commitment protocols, which are defined, or at least analyzed, in terms of the creation, satisfaction, or manipulation of the commitments among the participating agents. When protocols are employed in open environments, such as the Internet, they must be executed by agents that behave more or less autonomously and whose internal designs are not known. In such settings, therefore, there is a risk that the participating agents may fail to comply with the given protocol. Without a rigorous means to verify compliance, the very idea of protocols for interoperation is subverted. We develop an approach for testing whether the behavior of an agent complies with a commitment protocol. Our approach requires the specification of commitment protocols in temporal logic, and involves a novel way of synthesizing and applying ideas from distributed computing and logics of program.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    ISSN: 1573-7578
    Keywords: enterprise integration ; workflow management ; agents interoperation ; heterogeneous databases ; scientific decision support ; data mining
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The Carnot project was an ambitious research project inheterogeneous databases. It integrated a variety of techniques toaddress a wide range of problems in achieving interoperation inheterogeneous environments. Here we describe some of the majorimplemented applications of this project. These applications concern(a) accessing a legacy scientific database, (b) automating a workflowinvolving legacy systems, (c) cleaning data, and (d) retrievingsemantically appropriate information from structured databases inresponse to text queries. These applications support scientificdecision support, business process management, data integrityenhancement, and analytical decision support, respectively. Theydemonstrate Carnot‘s capabilities for (a) heterogeneous queryprocessing, (b) relaxed transaction and workflow management, (c)knowledge discovery, and (d) heterogeneous resource modelintegration.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Annals of mathematics and artificial intelligence 8 (1993), S. 47-71 
    ISSN: 1573-7470
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Speech act theory is important not only in Linguistics, but also in Computer Science. It has applications in Distributed Computing, Distributed Artificial Intelligence, Natural Language Processing, and Electronic Data Interchange protocols. While much research into speech acts has been done, one aspect of them that has largely been ignored is their semantics, i.e. their conditions of satisfaction. A formal semantics for speech acts is motivated and presented here that relates their satisfaction to the intentions, know-how, and actions of the participating agents. This makes it possible to state several potentially useful constraints on communication and provides a basis for checking their consistency.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...