In this paper we evaluate logic code analysis and transformation frameworks for their suitability as basic infrastructures for fast detection and extraction of (crosscutting) concerns. Using design patterns as example...
详细信息
In this paper we evaluate logic code analysis and transformation frameworks for their suitability as basic infrastructures for fast detection and extraction of (crosscutting) concerns. Using design patterns as example concerns, we identify desirable properties that an infrastructure should fulfill. We then report our initial results of evaluating candidate systems with respect to these properties. We show how high precision design pattern detectors can be easily formulated as predicates that are evaluated in mere seconds even on the sources of large software systems, such as the Eclipse IDE. Although details still remain to be analyzed further, our current results suggest that the pair JTransformer & CTC is a good candidate for a general infrastructure, combining very good querying performance, scalability and short turn-around times with a seamless integration of querying and transformation capabilities. Copyright 2007 ACM.
Object-oriented operating systems prefer to consider every data structure as an object. However, data structures predefined by the hardware's manufacturer do not fit into this scheme. First of all, traditional obj...
详细信息
We introduce an intelligent drivers' model for traffic simulation in a small area including some intersections, which is formalized in a paraconsistent annotated logic program EVALPSN. The intelligent drivers'...
详细信息
ISBN:
(纸本)9728865538
We introduce an intelligent drivers' model for traffic simulation in a small area including some intersections, which is formalized in a paraconsistent annotated logic program EVALPSN. The intelligent drivers' model can infer drivers' speed control actions such as "slow down" based on EVALPSN defeasible deontic reasoning and deal with minute speed change of cars in the simulation system.
A uniqueness type system is used to distinguish values which are referenced at most once from values which may be referenced an arbitrary number of times in a program. Uniqueness type systems are used in the Clean and...
详细信息
A uniqueness type system is used to distinguish values which are referenced at most once from values which may be referenced an arbitrary number of times in a program. Uniqueness type systems are used in the Clean and Mercury programming languages to provide efficiently updatable data-structures and I/O without compromising referential transparency. In this paper we establish a Curry-Howard-Lambek equivalence between a form of uniqueness types and a 'resource-sensitive' logic. This logic is similar to intuitionistic linear logic, however the circle modality, which moderates the structural rules in the antecedent in the same way as !, is introduced via the dual ? rules. We discuss the categorical proof theory and models of this new logic, as well as its computational interpretation. (c) 2005 Elsevier B.V. All rights reserved.
The proceedings contain 19 papers. The topics discussed include: topological representation of precontact algebras;relational semantics through duality;duality theory for projective algebras;relational approach to Boo...
详细信息
ISBN:
(纸本)3540333398
The proceedings contain 19 papers. The topics discussed include: topological representation of precontact algebras;relational semantics through duality;duality theory for projective algebras;relational approach to Boolean logic problems;static analysis of programs using omega algebra with tests;weak contact structures;on relational cycles;a framework for Kleene algebra with an embedded structure;non-termination in unifying theories of programming;towards an algebra of hybrid systems;relational correspondences for lattices with operators;control-flow semantics for assembly-level data-flow graphs;relational implementation of simple parallel evolutionary algorithms;lattice-based paraconsistent logic;verification of pushdown systems using omega algebra with domain;relational representability for algebras of substructural logics;Knuth-Bendix completion as a data structure;and time-dependent contact structures in Goguen categories.
Multi-agent systems (MAS) can take many forms depending on the characteristics of the agents populating them. Amongst the more demanding properties with respect to the design and implementation of multi-agent system i...
详细信息
ISBN:
(纸本)3540331069
Multi-agent systems (MAS) can take many forms depending on the characteristics of the agents populating them. Amongst the more demanding properties with respect to the design and implementation of multi-agent system is how these agents may individually reason and communicate about their knowledge and beliefs, with a view to cooperation and collaboration. In this paper, we present a deductive reasoning multi-agent platform using an extension of answer set programming (ASP). We show that it is capable of dealing with the specification and implementation of the system's architecture, communication and the individual agent's reasoning capacities. Agents are represented as Ordered Choice logic Programs (OCLP) as a way of modelling their knowledge and reasoning capacities, with communication between the agents regulated by uni-directional channels transporting information based on their answer sets. In the implementation of our system we combine the extensibility of the JADE framework with the flexibility of the OCT front-end to the Smodels answer set solver. The power of this approach is demonstrated by a multi-agent system reasoning about equilibria of extensive games with perfect information.
The proceedings contain 14 papers. The topics discussed include: modelling uncertainty in agent programming;complete axiomatizations of finite syntactic epistemic states;an architecture for rational agents;LAMA: a mul...
详细信息
ISBN:
(纸本)3540331069
The proceedings contain 14 papers. The topics discussed include: modelling uncertainty in agent programming;complete axiomatizations of finite syntactic epistemic states;an architecture for rational agents;LAMA: a multi-agent platform using ordered choice logicprogramming;a distributed architecture for norm-aware agent societies;about declarative semantics of logic-based agent languages;goal decomposition tree: an agent model to generate a validated agent behaviour;resource-bounded belief revision and contraction;agent-oriented programming with underlying ontological reasoning;dynagent: an incremental forward-chaining HTN planning agent in dynamic domains;a combination of explicit and deductive knowledge with branching time: completeness and decidability results;an intensional programming approach to multi-agent coordination in a distributed network of agents;and a tableau method for verifying dialogue game protocols for agent communication.
A uniqueness type system is used to distinguish values which are referenced at most once from values which may be referenced an arbitrary number of times in a program. Uniqueness type systems are used in the Clean and...
详细信息
A uniqueness type system is used to distinguish values which are referenced at most once from values which may be referenced an arbitrary number of times in a program. Uniqueness type systems are used in the Clean and Mercury programming languages to provide efficiently updatable data-structures and I/O without compromising referential transparency. In this paper we establish a Curry-Howard-Lambek equivalence between a form of uniqueness types and a 'resource-sensitive' logic. This logic is similar to intuitionistic linear logic, however the circle modality, which moderates the structural rules in the antecedent in the same way as !, is introduced via the dual ? rules. We discuss the categorical proof theory and models of this new logic, as well as its computational interpretation. (c) 2005 Elsevier B.V. All rights reserved.
In this paper we describe a procedure for developing models und associated proof systems for two styles of paraconsistent logic. We first give an Urquhart-style representation of bounded not necessarily discrete latti...
详细信息
Existing cognitive agent programming languages that are based on the BDI model employ logical representation and reasoning for implementing the beliefs of agents. In these programming languages, the beliefs are assume...
详细信息
ISBN:
(纸本)3540331069
Existing cognitive agent programming languages that are based on the BDI model employ logical representation and reasoning for implementing the beliefs of agents. In these programming languages, the beliefs are assumed to be certain, i.e. an implemented agent can believe a proposition or not. These programming languages fail to capture the underlying uncertainty of the agent's beliefs which is essential for many real world agent applications. We introduce Dempster-Shafer theory as a convenient method to model uncertainty in agent's beliefs. We show that the computational complexity of Dempster's Rule of Combination can be controlled. In particular, the certainty value of a proposition can be deduced in linear time from the beliefs of agents, without having to calculate the combination of Dempster-Shafer mass functions.
暂无评论