Multi-agent systems are viewed as consisting of individual agents whose behaviors are regulated by an organization artefact. This paper presents a simplified version of a programming language that is designed to imple...
详细信息
ISBN:
(纸本)9783642053009
Multi-agent systems are viewed as consisting of individual agents whose behaviors are regulated by an organization artefact. This paper presents a simplified version of a programming language that is designed to implement norm-based artefacts. Such artefacts are specified in terms of norms being enforced by monitoring, regimenting and sanctioning mechanisms. The syntax and operational semantics of the programming language are introduced and discussed. A logic is presented that can be used to specify and verify properties of programs developed in this language.
作者：
Wiggins, Geraint ADREAM Group
Department of Artificial Intelligence University of Edinburgh 80 South Bridge EdinburghEH1 1HN United Kingdom
I discuss issues of control and floundering during execution of automatically synthesised logic programs. The process of program synthesis can be restricted, without loss of generality, so that the only negated calls ...
详细信息
The papers in this volume are extended versions of presentations at the fourth internationalworkshop on Extensions of logicprogramming, held at the University of St Andrews, March/April 1993. Among the topics covere...
详细信息
ISBN:
(数字)9783540484172
ISBN:
(纸本)9783540580256
The papers in this volume are extended versions of presentations at the fourth internationalworkshop on Extensions of logicprogramming, held at the University of St Andrews, March/April 1993. Among the topics covered in the volume are: defintional reflection and completion, modules in lambda-Prolog, representation of logics as partial inductive definitions, non-procedural logicprogramming, knowledgerepresentation, contradiction avoidance, disjunctive databases, strong negation, linear logicprogramming, proof theory and regular search spaces, finite sets and constraint logicprogramming, search-space pruning and universal algebra, and implementation on transputer networks.
Snomed ct is a large-scale medical ontology, which is developed using a variant of the inexpressive Description logic EL. Description logic reasoning can not only be used to compute subsumption relationships between S...
详细信息
Snomed ct is a large-scale medical ontology, which is developed using a variant of the inexpressive Description logic EL. Description logic reasoning can not only be used to compute subsumption relationships between Snomed concepts, but also to pinpoint the reason why a certain subsumption relationship holds by computing the axioms responsible for this relationship. This helps developers and users of Snomed ct to understand why a given subsumption relationship follows from the ontology, which can be seen as a first step toward removing unwanted subsumption relationships. In this paper, we describe a new method for axiom pinpointing in the Description logic EL+, which is based on the computation of so-called reachabilitybased modules. Our experiments on Snomed ct show that the sets of axioms explaining subsumption are usually quite small, and that our method is fast enough to compute such sets on demand.
In this paper we propose the general software engineering approach of transforming an agent into an Agent Computational Environment (ACE) composed of: (1) the "main" agent program;(2) a number of Event-Actio...
详细信息
ISBN:
(纸本)9783319261843;9783319261836
In this paper we propose the general software engineering approach of transforming an agent into an Agent Computational Environment (ACE) composed of: (1) the "main" agent program;(2) a number of Event-Action modules for Complex Event Processing, including generation of complex actions;(3) a number of external contexts that the agent is able to access in order to gather information. In our view an ACE is composed of heterogeneous elements: therefore, we do not make assumptions about how the various components are defined, except that they are based upon Computational logic. In order to show a concrete instance of ACE, we discuss an experiment based upon the DALI agent-oriented programming language and Answer Set programming (ASP).
X is an untyped continuation-style formal language with a typed subset that provides a Curry-Howard isomorphism for a sequent calculus for implicative classical logic. X can also be viewed as a language for describing...
详细信息
X is an untyped continuation-style formal language with a typed subset that provides a Curry-Howard isomorphism for a sequent calculus for implicative classical logic. X can also be viewed as a language for describing nets by composition of basic components connected by wires. These features make X an expressive platform on which many different (applicative) programming paradigms can be mapped. In this paper we will present the syntax and reduction rules for X;in order to demonstrate its expressive power, we will show how elaborate calculi can be embedded, such as the lambda-calculus, Bloo and Rose's calculus of explicit substitutions lambda x, Parigot's lambda mu and Curien and Herbelin's lambda mu mu. X was first presented in Lengrand (2003), where it was called the lambda xi-calculus. It can be seen as the pure untyped computational content of the reduction system for the implicative classical sequent calculus of Urban (2000).
Adaptation is an important requirement for mobile applications due to the varying levels of resource availability that characterises mobile environments. However without proper control, multiple applications can each ...
详细信息
ISBN:
(纸本)0769516122
Adaptation is an important requirement for mobile applications due to the varying levels of resource availability that characterises mobile environments. However without proper control, multiple applications can each adapt independently in response to a range of different adaptive stimuli, causing conflicts or suboptimal performance. In this paper we present a policy driven approach for mobile adaptive systems that can overcome the aforementioned problems. Our system is based on a policy language derived from the Event Calculus logicprogramming formalism. Important characteristics of our policy language are the support for explicit expressions of time dependencies and the simple and user friendly syntax.
This paper describes the results of an experiment in the use of the Gödel logicprogramming language for object-oriented programming. An object-oriented program is implemented in Gödel at two levels. First, ...
详细信息
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.
We present a method for discovering new knowledge from structural data which are represented by graphs in the framework of inductive logicprogramming. A graph, or network, is widely used for representing relations be...
详细信息
ISBN:
(纸本)3540661093
We present a method for discovering new knowledge from structural data which are represented by graphs in the framework of inductive logicprogramming. A graph, or network, is widely used for representing relations between various data and expressing a small and easily understandable hypothesis. Formal Graph System (FGS) is a kind of logicprogramming system which directly deals with graphs just like first order terms. By employing refutably inductive inference algorithms and graph algorithmic techniques, we are developing a knowledge discovery system KD-FGS, which acquires knowledge directly from graph data by using FGS as a knowledgerepresentation language. In this paper we develop a logical foundation of our knowledge discovery system. A term tree is a pattern which consists of variables and tree-like structures. We give a polynomial-time algorithm for finding a unifier of a term tree and a tree in order to make consistency checks efficiently. Moreover we give experimental results on some graph theoretical notions with the system. The experiments show that the system is useful for finding new knowledge.
暂无评论