ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

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
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Bulletin of economic research 53 (2001), S. 0 
    ISSN: 1467-8586
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Economics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Autonomous agents and multi-agent systems 2 (1999), S. 357-401 
    ISSN: 1573-7454
    Keywords: intelligent agent ; agent-oriented programming ; practical reasoning rule ; comparison of agent programming languages ; control structure ; selection mechanism ; formal semantics ; meta transition system
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract An intriguing and relatively new metaphor in the programming community is that of an intelligent agent. The idea is to view programs as intelligent agents acting on our behalf. By using the metaphor of intelligent agents the programmer views programs as entities which have a mental state consisting of beliefs and goals. The computational behaviour of an agent is explained in terms of the decisions the agent makes on the basis of its mental state. It is assumed that this way of looking at programs may enhance the design and development of complex computational systems. To support this new style of programming, we propose the agent programming language 3APL. 3APL has a clear and formally defined semantics. The operational semantics of the language is defined by means of transition systems. 3APL is a combination of imperative and logic programming. From imperative programming the language inherits the full range of regular programming constructs, including recursive procedures, and a notion of state-based computation. States of agents, however, are belief or knowledge bases, which are different from the usual variable assignments of imperative programming. From logic programming, the language inherits the proof as computation model as a basic means of computation for querying the belief base of an agent. These features are well-understood and provide a solid basis for a structured agent programming language. Moreover, on top of that 3APL agents use so-called practical reasoning rules which extend the familiar recursive rules of imperative programming in several ways. Practical reasoning rules can be used to monitor and revise the goals of an agent, and provide an agent with reflective capabilities. Applying the metaphor of intelligent agents means taking a design stance. From this perspective, a program is taken as an entity with a mental state, which acts pro-actively and reactively, and has reflective capabilities. We illustrate how the metaphor of intelligent agents is supported by the programming language. We also discuss the design of control structures for rule-based agent languages. A control structure provides a solution to the problem of which goals and which rules an agent should select. We provide a concrete and intuitive ordering on the practical reasoning rules on which such a selection mechanism can be based. The ordering is based on the metaphor of intelligent agents. Furthermore, we provide a language with a formal semantics for programming control structures. The main idea is not to integrate this language into the agent language itself, but to provide the facilities for programming control structures at a meta level. The operational semantics is accordingly specified at the meta level, by means of a meta transition system.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 66 (2000), S. 79-119 
    ISSN: 1572-8730
    Keywords: internal and external non-determinism ; dynamic modal logic
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract We demonstrate ways to incorporate nondeterminism in a system designed to formalize the reasoning of agents concerning their abilities and the results of the actions that they may perform. We distinguish between two kinds of nondeterministic choice operators: one that expresses an internal choice, in which the agent decides what action to take, and one that expresses an external choice, which cannot be influenced by the agent. The presence of abilities in our system is the reason why the usual approaches towards nondeterminism cannot be used here. The semantics that we define for nondeterministic actions is based on the idea that composite actions are unravelled in the strings of atomic actions and tests that constitute them. The main notions used in defining this semantics are finite computation sequences and finite computation runs of actions. The results that we obtain meet our intuitions regarding events and abilities in the presence of nondeterminism.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Journal of logic, language and information 7 (1998), S. 228-229 
    ISSN: 1572-9583
    Source: Springer Online Journal Archives 1860-2000
    Topics: Linguistics and Literary Studies , Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Journal of logic, language and information 7 (1998), S. 341-367 
    ISSN: 1572-9583
    Keywords: Epistemic states ; default reasoning ; meta-level architectures ; temporal models
    Source: Springer Online Journal Archives 1860-2000
    Topics: Linguistics and Literary Studies , Computer Science
    Notes: Abstract We present an epistemic default logic, based on the metaphore of a meta-level architecture. Upward reflection is formalized by a nonmonotonic entailment relation, based on the objective facts that are either known or unknown at the object level. Then, the meta (monotonic) reasoning process generates a number of “default-beliefs” of object-level formulas. We extend this framework by proposing a mechanism to reflect these defaults down. Such a reflection is seen as essentially having a temporal flavour: defaults derived at the meta-level are projected as facts in a “next” object level state. In this way, we obtain temporal models for default reasoning in meta-level formalisms which can be conceived as labeled branching trees. Thus, descending the tree corresponds to shifts in time that model downward reflection, whereas the branching of the tree corresponds to ways of combining possible defaults. All together, this yields an operational or procedural semantics of reasoning by default, which admits one to reason about it by means of branching-time temporal logic. Finally, we define sceptical and credulous entailment relations based on these temporal models and we characterize Reiter extensions in our semantics.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Journal of logic, language and information 9 (2000), S. 125-128 
    ISSN: 1572-9583
    Source: Springer Online Journal Archives 1860-2000
    Topics: Linguistics and Literary Studies , Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Annals of mathematics and artificial intelligence 27 (1999), S. 25-47 
    ISSN: 1573-7470
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We give a general approach to characterizing minimal information in a modal context. Our modal treatment can be used for many applications, but is especially relevant under epistemic interpretations of the operator □. Relative to an arbitrary modal system, we give three characterizations of minimal information and provide conditions under which these characterizations are equivalent. We then study information orders based on bisimulations and Ehrenfeucht–Fraïssé games. Moving to the area of epistemic logics, we show that for one of these orders almost all systems trivialize the notion of minimal information. Another order which we present is much more promising as it permits to minimize with respect to positive knowledge. In S5, the resulting notion of minimal knowledge coincides with well‐established proposals. For S4 we compare the two orders.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Publication Date: 2020-09-01
    Print ISSN: 0004-3702
    Electronic ISSN: 1872-7921
    Topics: Computer Science
    Published by Elsevier
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Publication Date: 2016-01-28
    Description: We develop a logic for reasoning about semi-public environments , i.e. environments in which a process is executing, and where agents in the environment have partial and potentially different views of the process. Previous work on this problem illustrated that it was problematic to obtain both an adequate semantic model and a language for reasoning about semi-public environments. We here use program models for representing the changes that occur during the execution of a program. These models serve both as syntactic objects and as semantic models, and are a modification of action models in Dynamic Epistemic Logic, in the sense that they allow for ontic change (i.e. change in the world or state). We show how program models can elegantly capture a notion of observation of the environment. The use of these models resolves several difficulties identified in earlier work, and admit a much simpler treatment than was possible in previous work on semi-public environments.
    Print ISSN: 0955-792X
    Electronic ISSN: 1465-363X
    Topics: Computer Science , Mathematics
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Publication Date: 1993-01-01
    Print ISSN: 0955-792X
    Electronic ISSN: 1465-363X
    Topics: Computer Science , Mathematics
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...