Results 1  10
of
84
Leadsto: A language and environment for analysis of dynamics by simulation
 Proc. of the Third German Conference on MultiAgent System Technologies, MATES'05. Lecture Notes in Artificial Intelligence
, 2005
"... Abstract. This paper presents the language and software environment LEADSTO that has been developed to model and simulate the dynamics of MultiAgent Systems (MAS) in terms of both qualitative and quantitative concepts. The LEADSTO language is a declarative ordersorted temporal language, extended w ..."
Abstract

Cited by 182 (136 self)
 Add to MetaCart
Abstract. This paper presents the language and software environment LEADSTO that has been developed to model and simulate the dynamics of MultiAgent Systems (MAS) in terms of both qualitative and quantitative concepts. The LEADSTO language is a declarative ordersorted temporal language, extended with quantitative means. Dynamics of MAS can be modelled by specifying the direct temporal dependencies between state properties in successive states. Based on the LEADSTO language, a software environment was developed that performs simulations of LEADSTO specifications, generates simulation traces for further analysis, and constructs visual representations of traces. The approach proved its value in a number of projects within different domains of MAS research. 1
Symbolic Implementation of the Best Transformer
, 2004
"... This paper shows how to achieve, under certain conditions, abstractinterpretation algorithms that enjoy the best possible precision for a given abstraction. The key idea is a simple process of successive approximation that makes repeated calls to a decision procedure, and obtains the best abstra ..."
Abstract

Cited by 53 (18 self)
 Add to MetaCart
(Show Context)
This paper shows how to achieve, under certain conditions, abstractinterpretation algorithms that enjoy the best possible precision for a given abstraction. The key idea is a simple process of successive approximation that makes repeated calls to a decision procedure, and obtains the best abstract value for a set of concrete stores that are represented symbolically, using a logical formula.
Elicitation of Requirements from Multiple Perspectives
, 1991
"... The success of large software engineering projects depends critically on the specification, which must represent the requirements of a large number of people with widely differing perspectives. Conventional approaches to software engineering do not address the process of identifying and integrating ..."
Abstract

Cited by 35 (6 self)
 Add to MetaCart
(Show Context)
The success of large software engineering projects depends critically on the specification, which must represent the requirements of a large number of people with widely differing perspectives. Conventional approaches to software engineering do not address the process of identifying and integrating these perspectives, but instead concentrate on the maintenance of a single consistent description. This results in a specification which represents only one point of view, often the analyst's, excluding suggestions which do not fit with this view. The processes which led to the adoption of this point of view will go unrecorded, making any rationale attached to such a specification incomplete. Other participants will not be able to validate it properly, as it does not relate to their requirements. This thesis integrates ideas drawn from the study of knowledge acquisition, computersupported cooperative work and negotiation into a model of the specification activity which allows the capture ...
Logical characterizations of heap abstractions
, 2003
"... Abstract. Shape analysis concerns the problem of determining “shape invariants” for programs that perform destructive updating on dynamically allocated storage. In recent work, we have shown how shape analysis can be performed, using an abstract interpretation based on 3valued firstorder logic. In ..."
Abstract

Cited by 34 (7 self)
 Add to MetaCart
(Show Context)
Abstract. Shape analysis concerns the problem of determining “shape invariants” for programs that perform destructive updating on dynamically allocated storage. In recent work, we have shown how shape analysis can be performed, using an abstract interpretation based on 3valued firstorder logic. In that work, concrete stores are finite 2valued logical structures, and the sets of stores that can possibly arise during execution are represented (conservatively) using a certain family of finite 3valued logical structures. In this paper, we show how 3valued structures that arise in shape analysis can be characterized using formulas in firstorder logic with transitive closure. We also define a nonstandard (“supervaluational”) semantics for 3valued firstorder logic that is more precise than a conventional 3valued semantics, and demonstrate that it can be effectively implemented using existing theorem provers. 1
Temporal Theories of Reasoning
 LOGICS IN ARTIFICAL INTELLIGENCE, PROC. OF THE 4TH EUROPEAN WORKSHOP ON LOGICS IN ARTIFICIAL INTELLIGENCE, JELIA ’94
, 1994
"... In this paper we describe a general way of formalizing reasoning behaviour. Such a behaviour may be described by all the patterns which are valid for the behaviour. A pattern can be seen as a sequence of information states which describe what has been derived at each time point. A transition from ..."
Abstract

Cited by 33 (28 self)
 Add to MetaCart
In this paper we describe a general way of formalizing reasoning behaviour. Such a behaviour may be described by all the patterns which are valid for the behaviour. A pattern can be seen as a sequence of information states which describe what has been derived at each time point. A transition from an information state at a point in time to the state at the (or a) next time point is induced by one or more inference steps. We choose to model the information states by partial models and the patterns either by linear time or branching time temporal models. Using temporal logic one can define theories and look at all models of that theory. For a number of examples of reasoning behaviour we have been able to define temporal theories such that its (minimal) models correspond to the valid patterns of the behaviour. These theories prescribe that the inference steps which are possible, are "executed " in the temporal model. The examples indicate that partial temporal logic is a powerful means of describing and formalizing complex reasoning patterns, as the dynamic aspects of reasoning systems are integrated into the static ones in a clear fashion.
Formal Semantics of MetaLevel Architectures: Dynamic Control of Reasoning
, 2002
"... Metalevel architectures for dynamic control of reasoning processes are quite powerful. In the literature many
..."
Abstract

Cited by 22 (14 self)
 Add to MetaCart
Metalevel architectures for dynamic control of reasoning processes are quite powerful. In the literature many
The stories of logic and information
 In Handbook of the Philosophy of Information, P. Adriaans and
, 2008
"... ..."
Temporal Semantics of Compositional Task Models And Problem Solving Methods
 Data and Knowledge Engineering
, 1999
"... Task models and problem solving methods can be specified informally or formally. In recent years various approaches have formalized their notion of task model or problem solving method. Most modelling approaches concentrate on the form of a task model or problem solving method rather than on thei ..."
Abstract

Cited by 17 (16 self)
 Add to MetaCart
Task models and problem solving methods can be specified informally or formally. In recent years various approaches have formalized their notion of task model or problem solving method. Most modelling approaches concentrate on the form of a task model or problem solving method rather than on their precise semantics; a formalisation is often only a syntactical formalisation. A more precise definition of the semantics requires explication of the control of a system's behaviour. In this paper temporal semantics is defined for a compositional modelling approach to task models and problem solving methods. The semantics is a description of a compositional system's behaviour; a temporal approach provides a means to describe the dynamics involved. The formalisation of the semantics is based on compositional threevalued temporal models. The compositional structure of information states, transitions and reasoning traces provides a transparant model of the system's behaviour, both conceptually and formally.
Realistic belief revision
 In Proceedings of the Second World Conference on Foundations of Artificial Intelligence (WOCFAI
, 1995
"... Abstract In this paper we consider the implications for belief revision of weakening the logic under which belief sets are taken to be closed. A widely held view is that the usual belief revision functions are highly classical, especially in being driven by consistency. We show that, on the contrary ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
(Show Context)
Abstract In this paper we consider the implications for belief revision of weakening the logic under which belief sets are taken to be closed. A widely held view is that the usual belief revision functions are highly classical, especially in being driven by consistency. We show that, on the contrary, the standard representation theorems still hold for paraconsistent belief revision. Then we give conditions under which consistency is preserved by revisions, and we show that this modelling allows for the gradual revision of inconsistency. 1 Realistic Logics Belief Revision is a rich and diverse eld. The unit of study is most often a belief set  a set K of sentences (propositions, whatever) closed under a consequence relation. In Gardenfors ' canonical text [6], and in nearly all other studies of belief revision, the notion of consequence is taken to be superclassical. Consequence at least includes classical propositional consequence. This is a theoretical simpli cation. Noone believes that belief is closed under that sort of consequence. If it were, we would believe all
Ambiguity and Reasoning
, 1995
"... In this paper, reasoning with ambiguous representations is explored in a formal way, with ambiguities at the level of propositions in propositional logic and predicate logic, and ambiguous representations of scopings in predicate logic as the main examples. First a version of propositional logic wit ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
In this paper, reasoning with ambiguous representations is explored in a formal way, with ambiguities at the level of propositions in propositional logic and predicate logic, and ambiguous representations of scopings in predicate logic as the main examples. First a version of propositional logic with propositional ambiguities is presented and a sequent axiomatization for it is given. This is then extended to predicate logic. Next, predicate logic with scope ambiguities is introduced and discussed, and again a sequent calculus for it is proposed. The conclusion connects the results to natural language semantics, and briefly compares them with existing logics of ambiguity. An appendix gives completeness proofs for our versions of ambiguous propositional and predicate logic. AMS Subject Classification (1991): 03B65, 03B80, 68S05, 68T30, 92K20. CR Subject Classification (1991): F.3.1, F.3.2, I.2.1, I.2.4, I.2.7. Keyword and Phrases: Semantics of Natural Language, Reasoning with Underspec...